// Problem: C2. k-LCM (hard version)
// Contest: Codeforces - Codeforces Round #708 (Div. 2)
// URL: https://codeforces.com/problemset/problem/1497/C2
// Memory Limit: 256 MB
// Time Limit: 1000 ms
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define INF (int)1e9
#define EPS 1e-9
#define PI 3.1415926535897932384626433832795
#define all(a) a.begin(), a.end()
#define x first
#define y second
#define MOD 1000000007
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef double ld;
int main() {
  // your code goes here
  // freopen("input.txt","r",stdin);
  // freopen("output.txt","w",stdout);

  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int n;
  cin >> n;
  vi a(n + 1);
  vii mp(5000100);
  set<int> s;
  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 temp = a[i] + a[j];
      ii t = {i, j};
      // cout << t.x+1 << " " << t.y+1 << " " << temp << "\n";
      if (mp[temp].x != 0) {
        ii t2 = mp[temp];

        if (t2.x == t.x || t2.y == t.x || t2.x == t.y || t2.y == t.y) continue;
        cout << "YES\n";
        cout << i << " " << j << " " << mp[temp].x << " " << mp[temp].y << "\n";
        exit(0);
      } else {
        mp[temp] = {i, j};
      }
    }
  }
  cout << "NO\n";
  return 0;
}