#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }


int N;
vector<Int> A;

void Answer(int i, int j, int k, int l) {
  puts("YES");
  printf("%d %d %d %d\n", i + 1, j + 1, k + 1, l + 1);
}

bool solve() {
  vector<int> is;
  for (int i = 0; i < N - 1; ++i) if (A[i + 1] / A[i] == 1) {
    is.push_back(i);
  }
  sort(is.begin(), is.end());
  const int isLen = is.size();
  for (int e = 0; e < isLen; ++e) {
    for (int f = e + 1; f <= e + 2 && f < isLen; ++f) {
      if (is[f] - is[e] > 1) {
        Answer(is[e], is[e] + 1, is[f], is[f] + 1);
        return true;
      }
    }
  }
  
  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]) {
        Answer(i, j, k, l);
        return true;
      }
    }
  }
  return false;
}

int main() {
  for (; ~scanf("%d", &N); ) {
    A.resize(N);
    for (int i = 0; i < N; ++i) {
      scanf("%lld", &A[i]);
    }
    
    const bool res = solve();
    if (!res) {
      puts("NO");
    }
  }
  return 0;
}