#include <bits/stdc++.h>
#define rep(i,j,k) for(int i=(j);i<=(k);i++)
#define per(i,j,k) for(int i=(j);i>=(k);i--)
#define uint unsigned int
#define ll long long
#define ull unsigned long long
#define db double
#define ldb long double
#define pii pair<int,int>
#define pll pair<ll,ll>
#define mkp make_pair
#define eb emplace_back
#define SZ(S) (int)S.size()
//#define mod 998244353
//#define mod 1000000007
#define inf 0x3f3f3f3f
#define linf 0x3f3f3f3f3f3f3f3f
using namespace std;

template <class T>
void chkmax(T &x,T y){
	if(x < y) x = y;
}

template <class T>
void chkmin(T &x,T y){
	if(x > y) x = y;
}

inline int popcnt(int x){
	return __builtin_popcount(x);
}

inline int ctz(int x){
	return __builtin_ctz(x);
}


/*ll power(ll p,int k = mod - 2){
	ll ans = 1;
	while(k){
		if(k % 2 == 1) ans = ans * p % mod;
		p = p * p % mod;
		k /= 2;	
	}
	return ans;
}*/
int n;
ll a[500005];

int main(){
	scanf("%d",&n);
	int p = -1,q = n + 1;
	rep(i,1,n) scanf("%lld",&a[i]);
	rep(i,1,n - 1){
		if(2 * a[i] > a[i + 1]){
			chkmax(p,i);
			chkmin(q,i);
		}
	}
	if(p > q + 1){
		printf("YES\n");
		printf("%d %d %d %d\n",q,q + 1,p,p + 1);
		return 0;
	}
	rep(i,1,n){
		rep(j,i + 1,n){
			rep(s,j + 1,n){
				rep(t,s + 1,n){
					if(a[t] / a[s] == a[j] / a[i]){
						printf("YES\n");
						printf("%d %d %d %d\n",i,j,s,t);
						return 0;
					}
				}
			}
		}
	}
	printf("NO\n");
	return 0;
}