#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef tuple<int, int, int> tii;
typedef tuple<ll, ll, ll> tll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vl;
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define nl "\n"
#define all(v) v.begin(),v.end()
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define sz(x) (int)(x).size()

const int maxn = 5e5 + 5;

ll n, m, q, k, t, a, b, c;
ll arr[maxn];

int main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	cin >> n;
	for (int i = 1; i <= n; i++) {
		cin >> arr[i];
	} 
	if (n >= 100) {
		map<ll, int> ma;
		cout << "YES\n";
		for (int i = 2; i <= n; i++) {
			ll x = arr[i] / arr[i - 1];
			if (ma[x] != 0) {
				cout << ma[x] - 1 << " " << ma[x] << " " << i - 1 << " " << i << nl;
				break;
			}
			ma[x] = i;
		}
		return 0;
	}
	bool ok = false;
	for (int i = 1; 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 (ok) break;
					if (arr[j] /  arr[i] == arr[l] / arr[k]) {
						cout << "YES\n";
						cout << i << " " << j << " " << k << " " << l << nl;
						ok = true;
					}
				}
			}
		}
	}
	if (!ok) cout << "NO\n";
}