#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long ull;

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll myRand(ll B) {
    return (ull)rng() % B;
}
inline double time() {
    return static_cast<long double>(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count()) * 1e-9;
}

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int n; cin >> n;
    vector<ll> a(n);
    for (int i = 0; i < n; ++i) {
        cin >> a[i];
    }
    int p = -1;
    for (int i = 0; i+1 < n; ++i) {
        if (a[i+1]/a[i] == 1) {
            if (p == -1) {
                p = i; i++;
            }
            else {
                cout << "YES" << endl;
                cout << p+1 << " " << p+2 << " " << i+1 << " " << i+2 << endl;
                return 0;
            }
        }
    }
    for (int i = 0; i < n; ++i) {
        for (int j = i+1; j < n; ++j) {
            for (int k = j+1; k < n; ++k) {
                for (int l = k+1; l < n; ++l) {
                    if (a[j]/a[i] == a[l]/a[k]) {
                        cout << "YES" << endl;
                        cout << i+1 << " " << j+1 << " " << k+1 << " " << l+1 << endl;
                        return 0;
                    }
                }
            }
        }
    }
    cout << "NO" << endl;
}