It was the third month of remote learning, Nastya got sick of staying at dormitory, so she decided to return to her hometown. In order to make her trip more entertaining, one of Nastya's friend presented her an integer array a. 

Several hours after starting her journey home Nastya remembered about the present. To entertain herself she decided to check, are there four different indices x, y, z, w such that a_x + a_y = a_z + a_w.

Her train has already arrived the destination, but she still hasn't found the answer. Can you help her unravel the mystery?

Input

The first line contains the single integer n (4 ≤ n ≤ 200 000) — the size of the array.

The second line contains n integers a_1, a_2, …, a_n (1 ≤ a_i ≤ 2.5 ⋅ 10^6).

Output

Print "YES" if there are such four indices, and "NO" otherwise.

If such indices exist, print these indices x, y, z and w (1 ≤ x, y, z, w ≤ n).

If there are multiple answers, print any of them.

Examples

Input


6
2 1 5 2 7 4


Output


YES
2 3 1 6 

Input


5
1 3 1 9 20


Output


NO

Note

In the first example a_2 + a_3 = 1 + 5 = 2 + 4 = a_1 + a_6. Note that there are other answer, for example, 2 3 4 6.

In the second example, we can't choose four indices. The answer 1 2 2 3 is wrong, because indices should be different, despite that a_1 + a_2 = 1 + 3 = 3 + 1 = a_2 + a_3
#include <bits/stdc++.h>
#define ll long long
// #define mod (1000000007ll)
// #define md (1000000007ll)
#define inf 1100000000000009
// #define sz 500005
// #define sz 1000000000000
using namespace std; 
#define fast ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL)
#define endl "\n"
#define double long double
#define log log10l


const ll mod = 1000000007ll;
const ll md = mod;
const ll sz = 5000005;
ofstream out("out1.txt");

int dx[] = {1,0,-1,0};
int dy[] = {0,1,0,-1};

inline void add(ll &a, ll b) {
  a += b;
  if (a >= md) a -= md;
}

inline void sub(ll &a, ll b) {
  a -= b;
  if (a < 0) a += md;
}

inline ll mul(ll a, ll b) {
#if !defined(_WIN32) || defined(_WIN64)
  return (ll) ((long long) a * b % md);
#endif
  unsigned long long x = (long long) a * b;
  unsigned xh = (unsigned) (x >> 32), xl = (unsigned) x, d, m;
  asm(
    "divl %4; \n\t"
    : "=a" (d), "=d" (m)
    : "d" (xh), "a" (xl), "r" (md)
  );
  return m;
}

inline ll power(ll a, long long b) {
  ll res = 1;
  while (b > 0) {
    if (b & 1) {
      res = mul(res, a);
    }
    a = mul(a, a);
    b >>= 1;
  }
  return res;
}

inline ll inv(ll a) {
  a %= md;
  if (a < 0) a += md;
  ll b = md, u = 0, v = 1;
  while (a) {
    ll t = b / a;
    b -= t * a; swap(a, b);
    u -= t * v; swap(u, v);
  }
  assert(b == 1);
  if (u < 0) u += md;
  return u;
}

// bool compare(const pair<double, ll> &l, const pair<double, ll> &r){
//  if(abs(l.first - r.first) < 1e-9)
//      return l.second > r.second;
//  return l.first > r.first;
//  if(l.first != r.first)
//      return l.first > r.first;

//  return l.second > r.second;
// }

struct node {
    ll a, b, c, d, i;
};

struct Point 
{ 
    int x; 
    int y; 
    int z;
};

bool compareNode(const node &l, const node &r){
    if(l.a != r.a)
        return l.a < r.a;
    return l.b < r.b;
}

bool compare1(const Point &l, const Point &r){
    if(l.x != r.x) return l.x < r.x;
    else
        return l.y < r.y;
}

bool compare2(const pair<Point, Point> &l, const pair<Point, Point> &r){
    return l.first.x < r.first.x;
}

bool compare(const node &l, const node &r){
    if(l.a != r.a)
        return l.a < r.a;
    return l.b < r.b;
}

 
 
bool onSegment(Point p, Point q, Point r) 
{ 
    if (q.x <= max(p.x, r.x) && q.x >= min(p.x, r.x) && 
        q.y <= max(p.y, r.y) && q.y >= min(p.y, r.y)) 
       return true; 
  
    return false; 
} 

int orientation(Point p, Point q, Point r) 
{ 
    
    int val = (q.y - p.y) * (r.x - q.x) - 
              (q.x - p.x) * (r.y - q.y); 
  
    if (val == 0) return 0;  
  
    return (val > 0)? 1: 2;  
} 
  
bool doIntersect(Point p1, Point q1, Point p2, Point q2) 
{ 
    int o1 = orientation(p1, q1, p2); 
    int o2 = orientation(p1, q1, q2); 
    int o3 = orientation(p2, q2, p1); 
    int o4 = orientation(p2, q2, q1); 
  
    if (o1 != o2 && o3 != o4) 
        return true; 
    if (o1 == 0 && onSegment(p1, p2, q1)) return true; 
    if (o2 == 0 && onSegment(p1, q2, q1)) return true; 
    if (o3 == 0 && onSegment(p2, p1, q2)) return true; 
    if (o4 == 0 && onSegment(p2, q1, q2)) return true; 
  
    return false;
} 

vector<int> ans;

bool dfs(vector<vector<int> > &adj, int node,vector<bool> &visited)
{
    stack<Point> s;
    s.push({node, -1, -1});
    visited[node] = true;
    int par = -1;

    while(!s.empty()){
        auto fr = s.top();
        int temp = fr.x;
        par = fr.y;
        int idx = fr.z;
        idx+=1;

        // cout<<temp<<", "<<par<<endl;

        bool flag = false; 

        for(int j = idx; j < adj[temp].size(); j++){
            int u = adj[temp][j];
            if(u != par){
                if(!visited[u]){
                    // cout<<"u = "<<u<<endl;
                    visited[u] = true; 
                    s.top().z = j;
                    s.push({u, temp, -1});
                    flag = true;
                    break;
                }
                else{
                    // cout<<s.size() + 1<<endl;
                    ans.push_back(u);
                    // cout<<u<<" ";
                    while(!s.empty()){
                        if(s.top().x == u){
                            ans.push_back(u);
                            break;
                        }
                        ans.push_back(s.top().x);
                        // cout<<s.top().x<<" ";
                        s.pop();
                    }
                    // cout<<endl;
                    return true;
                }
            }
        }

        if(!flag){
            // cout<<"POP"<<endl;
            // cout<<s.top().x<<endl;
            // cout<<s.top().y<<endl;
            s.pop();
        }
    }

    return false;
}

bool isvalid(vector<vector<int> > &v, int i, int j){
    int n = v.size();
    int m = v[0].size();

    if(i < 0 or i >= n or j < 0 or j >= m) return false;
    return true;
}


vector<char> findDirection(vector<pair<int, int> > &v){
    int n = v.size();
    vector<char> ans;

    for(int i=1;i<n;i++){
        if(v[i].first == v[i-1].first){
            //L or R

            if(v[i].second > v[i-1].second)
                ans.push_back('R');
            else
                ans.push_back('L');
        }
        else{
            // U or D
            if(v[i].first > v[i-1].first)
                ans.push_back('D');
            else
                ans.push_back('U');
        }
    }
    return ans;
}

void solve(){
    int n, a, b;
    cin>>n;
    vector<int> v(n);
    // unordered_map<int, pair<int, int> > mp;
    vector<pair<int, int> > mp(sz, {-1, -1});

    for(int i=0;i<n;i++){
        cin>>v[i];
    }

    for(int i=0;i<n;i++){
        for(int j=i+1;j<n;j++){
            int temp = v[i] + v[j];
            if(mp[temp].first != -1){
                auto x = mp[temp];
                a = x.first;
                b = x.second;

                if(a == i or a == j or b == i or b == j)
                    continue;
                cout<<"YES"<<endl;
                cout<<a+1<<" "<<b+1<<" "<<i+1<<" "<<j+1<<endl;
                return;

            }

            mp[temp] = {i, j};
        }
    }

    cout<<"NO"<<endl;
}



int main()
{
    fast;

    // freopen("a.txt", "r", stdin);
    solve();

    // ll t;
    // cin>>t;
    // while(t--){
    //  solve();
    // }

}
