#include <bits/stdc++.h>
#define int long long
#define fi first
#define se second
#define pdd pair<double, double>
#define pii pair<int,int>
#define endl '\n'
const int INF = 1e9+10;
const int MOD = 1e9+7;
using namespace std;
// -----------------------------------------------------------------------------------------------
int a[200005];
pii v[5000005];
signed main(){
ios_base::sync_with_stdio(0);
cin.tie(0);cout.tie(0);
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
int n;cin >> n;
for(int i=1;i<=n;i++){
cin >> a[i];
}
for(int i=1;i<=n;i++){
for(int j=i+1;j<=n;j++){
int tot = a[i]+a[j];
pii brr = {0LL,0LL};
if(v[tot] == brr){
v[tot] = {i,j};
}
else{
if(v[tot].fi == i || v[tot].se == i){
continue;
}
else if(v[tot].fi == j || v[tot].se == j){
continue;
}
else{
cout << "YES" << endl;
cout << v[tot].fi << " " << v[tot].se << " " << i << " " << j << endl;
return 0;
}
}
}
}
cout << "NO" << endl;
}
Numbers in a matrix | Sequences |
Split houses | Divisible |
Three primes | Coprimes |
Cost of balloons | One String No Trouble |
Help Jarvis! | Lift queries |
Goki and his breakup | Ali and Helping innocent people |
Book of Potion making | Duration |
Birthday Party | e-maze-in |
Bricks Game | Char Sum |
Two Strings | Anagrams |
Prime Number | Lexical Sorting Reloaded |
1514A - Perfectly Imperfect Array | 580A- Kefa and First Steps |
1472B- Fair Division | 996A - Hit the Lottery |
MSNSADM1 Football | MATCHES Playing with Matches |
HRDSEQ Hard Sequence | DRCHEF Doctor Chef |