/**
 *      Author:  Nicholas Winschel
 *      Created: 08.29.2023 10:34:44
**/

#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using db=long double;
template<class T> using V=vector<T>;
using vi = V<int>;
using vl = V<ll>;
using pi = pair<int,int>;
#define f first
#define s second
#define sz(x) (int)((x).size())

int main() {
	cin.tie(0)->sync_with_stdio(0); // initialize fast I/O

	int n; cin >> n;
	vl a(n); for (auto &&p : a) cin >> p;
	if (n < 100) {
		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 h = k+1; h < n; h++) {
						if (a[h]/a[k] == a[j]/a[i]) {
							cout << "YES\n";
							cout << i+1 << " " << j+1 << " " << k+1 << " " << h+1 << "\n";
							return 0;
						}
					}
				}
			}
		}
		cout << "NO\n";
		return 0;
	} else {
		V<vi> inds(65);
		vi oki;
		for (int i = 0; i < n; i++) inds[__builtin_clzll(a[i])].push_back(i);
		reverse(inds.begin(), inds.end());
		for (int i = 0; i < 65; i++) 
			if (sz(inds[i]) > 1) oki.push_back(i);
		assert(sz(oki));
		int i,j,k,l;
		i=inds[oki[0]][0], j = inds[oki[0]][1];
		if (sz(inds[oki[0]]) >= 4) {
			k = inds[oki[0]][2], l = inds[oki[0]][3];
		} else {
			k = inds[oki[1]][0], l = inds[oki[1]][1];
		}
		cout << "YES\n";
		i++,j++,k++,l++;
		cout << i << " " << j << " " << k << " " << l << "\n";
	}

	return 0;
}