#include <bits/stdc++.h>

using namespace std;

int main() {
  int n; cin >> n;
  vector <long long> a(n);
  for (long long &x : a) scanf("%lld", &x);
  vector <pair <long long, int>> ratio(n - 1);
  for (int i = 0; i < n - 1; ++i) {
    ratio[i] = make_pair(a[i + 1] / a[i], i);
  }
  sort(ratio.begin(), ratio.end());
  for (int i = 0, j = 0; i < ratio.size(); i = j) {
    int minIndex = INT_MAX, maxIndex = INT_MIN;
    while (j < ratio.size() and ratio[j].first == ratio[i].first) {
      minIndex = min(minIndex, ratio[j].second);
      maxIndex = max(maxIndex, ratio[j].second);
      ++j;
    }
    if (minIndex + 1 < maxIndex) {
      cout << "YES\n" << minIndex + 1 << " " << minIndex + 2 << " " << maxIndex + 1 << " " << maxIndex + 2 << '\n';
      return 0;
    }
  }
  for (int i = 0; i < n; ++i) {
    for (int j = i + 1; j < n; ++j) {
      for (int k = j + 1; k < n; ++k) {
        for (int l = k + 1; l < n; ++l) {
          if (a[j] / a[i] == a[l] / a[k]) {
            cout << "YES\n" << i + 1 << " " << j + 1 << " " << k + 1 << " " << l + 1 << '\n';
            return 0;
          }
        }
      }
    }
  }
  cout << "NO\n";
  return 0;
}