#include <bits/stdc++.h>
#define int long long

using namespace std;

int ans[2][2];

void printAns() {
    for(int i = 0; i < 2; ++i) {
        for(int j = 0; j < 2; ++j) {
            cout << ans[i][j] + 1 << ' ';
        }
    }
    exit(0);
}

int32_t main() {
    int n;
    cin >> n;
    vector<int> a(n);
    for(int &x : a) cin >> x;
    int ans[2][2];
    int z = 0;
    for(int i = 1; i < n && z < 2; ++i) {
        if(a[i] < a[i - 1]) {
            ans[z][0] = i - 1;
            ans[z][1] = i;
            z++;
            i++;
        }
    }
    if(z == 2) {
        cout << "YES\n";
        printAns();
    }
    if(n < 1000) {
        map<int, pair<int, int>> dic;
        for(int i = 0; i < n; ++i) {
            for(int j = i + 1; j < n; ++j) {
                if(dic.count(a[j]/a[i])) {
                    cout << "YES\n";
                    auto h = dic[a[j]/a[i]];
                    cout << h.first+1 << ' ' << h.second + 1 << ' ' << i + 1 << ' ' << j + 1 << endl;
                    return 0;
                }
            }
            for(int j = 0; j < i; j++) {
                dic[a[i]/a[j]] = make_pair(j, i);
            }
        }
        cout << "NO\n";
        return 0;
    }

    cout << "YES\n";
    int quebra = 0;
    for(int i = 1; i < n; ++i) {
        if(a[i] < a[i - 1]) {
            quebra = i;
            break;
        }
    }
    vector<int> b;
    if(quebra < n / 2) {
        for(int i = quebra; i < n; ++i) {
            b.push_back(a[i]);
        }
    } else {
        for(int i = quebra - 1; i >= 0; --i) {
            b.push_back(a[i]);
        }
    }

    vector<vector<int>> bits(100, vector<int>());

    for(int i = 0; i < b.size(); ++i) {
        for(int j = 62; j >= 0; j--) {
            if(b[i] & (1ll << j)) {
                bits[j].push_back(i);
                break;
            }
        }
    }

    for(int i = 0; i < bits.size(); ++i) {
        if(bits[i].size() >= 4) {
            for(int j = 0; j < 4; ++j) {
                cout << bits[i][j] + 1 << ' ';
            }
            exit(0);
        }
    }
    assert(false);
}