#include <bits/stdc++.h>

#define lsb(x) (x & (-x))

using ull = unsigned long long;
using ll = long long;

using namespace std;

void solve() {
  int n;
  cin >> n;
  vector<ll> a(n + 1, 0);
  for (int i = 1; i <= n; ++i)
    cin >> a[i];

  if (n <= 60) {
    for (int i = 1; i < n; ++i) {
      for (int j = i + 1; j < n; ++j) {
        for (int p = j + 1; p < n; ++p) {
          for (int q = p + 1; q <= n; ++q) {
            if (a[j] / a[i] == a[q] / a[p]) {
              cout << "YES\n";
              cout << i << " " << j << " " << p << " " << q << endl;
              return;
            }
          }
        }
      }
    }
  } else {
    map<ll, int> f;
    for (int i = 1; i < n; ++i) {
      ll x = a[i + 1] / a[i];
      if (f.count(x)) {
        cout << "YES\n";
        cout << f[x] << " " << f[x] + 1 << " " << i << " " << i + 1 << endl;
        return;
      }
      if (i - 1 > 0) {
        f[a[i] / a[i - 1]] = i - 1;
      }
    }
  }

  cout << "NO";
}

int main() {
#ifdef HOME
  ifstream cin("input.in");
  ofstream cout("output.out");
#endif
  ios::sync_with_stdio(false);
  cin.tie(0), cout.tie(0);
  
  int t = 1;
  //cin >> t;
  while (t--)
    solve();

  return 0;
}