#include <iostream>
using namespace std;
const int mn = 1e5+9;
typedef long long ll;
ll a[mn], d[mn], p[mn];
double sum[mn], maxx = 0; // 显式初始化更保险
int main(){
int n;
cin >> n;
for(int i=1;i<=n;i++){
cin >> a[i];
d[i] = d[i-1]+a[i];
}
p[n] = a[n];
for(int i=n-1;i>=1;i--){
p[i] = min(p[i+1], a[i]);
}
for(int i=1;i<=n-2;i++){
ll ans = d[n]-d[i];
ans -= p[i+1];
sum[i] = ans1.0/(n-i-1);
maxx = max(maxx, ans1.0/(n-i-1));
}
for(int i=1;i<=n-2;i++){
if(sum[i]==maxx) cout << i << "\n";
}
return 0;
}
