#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=(a);i<=(b);++i)
#define per(i,a,b) for(int i=(a);i>=(b);--i)
using namespace std;
using LL=long long;
const int P=998244353;
int ad(int x,int y){return x+y<P?x+y:x+y-P;}
int su(int x,int y){return x-y<0?x-y+P:x-y;}
int mu(int x,int y){return 1ULL*x*y%P;}
int po(int a,int b){
	int ret=1;
	while(b){
		if(b&1)ret=mu(ret,a);
		b>>=1;
		a=mu(a,a);
	}
	return ret;
}
#define N 500005
#define int long long
int a[N],n;
void chk(int i,int j,int p,int q)
{
	if(i<j&&j<p&&p<q)
	{
		if(a[j]/a[i]==a[q]/a[p])
		{
			printf("YES\n");
			printf("%lld %lld %lld %lld\n",i,j,p,q);
			exit(0);
		}
	}
}
map<int,pair<int,int>> res;
signed main(){
#ifdef xay5421
	freopen("b.in","r",stdin);
#endif
	cin>>n;
	for(int i=1;i<=n;i++) scanf("%lld",&a[i]);
	for(int i=1;i+3<=n;i++) chk(i,i+1,i+2,i+3);
	for(int j=n;j>=1;j--)
	{
		for(int k=j+2;k<=n;k++) res[a[k]/a[j+1]]=make_pair(j+1,k);
		for(int i=1;i<j;i++)
		{
			if(res.count(a[j]/a[i]))
			{
				chk(i,j,res[a[j]/a[i]].first,res[a[j]/a[i]].second);
			}
		}
	}
	printf("NO\n");
	return 0;
}