#include <bits/stdc++.h>
using namespace std;

int main() {
    int n; scanf("%d", &n);
    vector<long long> a(n);
    for (int i = 0; i < n; i++) {
        scanf("%lld", &a[i]);
    }
    int first = -1, last = -1;
    for (int i = 1; i < n; i++) {
        if ((a[i] / a[i - 1]) == 1ll) {
            if (first == -1)
                first = i;
            last = i;
        }
    }
    if (last - first >= 2) {
        printf("YES\n");
        printf("%d %d %d %d\n", first, first + 1, last, last + 1);
        return 0;
    }
    if (n >= 1000) {
        printf("NO\n");
        return 0;
    }
    map<long long, pair<int, int>> f, l;
    for (int i = 1; i < n; i++) {
        for (int j = 0; j < i; j++) {
            long long x = a[i] / a[j];
            if (f.find(x) == f.end())
                f[x] = {j + 1, i + 1};
            l[x] = {j + 1, i + 1};
        }
    }
    for (auto x: f) {
        auto y = l[x.first];
        if (y.first > x.second.second) {
            printf("YES\n");
            printf("%d %d %d %d\n", x.second.first, x.second.second, y.first, y.second);
            return 0;
        }
    }
    printf("NO\n");
    return 0;
}