#include <iostream>#include <string>#include <cstdio>#include <cmath>#include <cstring>#include <algorithm>#include <map>#include <vector>#include <queue>#include <stack>#define LL long long#define MAXI 2147483647#define MAXL 9223372036854775807#define eps (1e-8)#define dg(i) cout << "*" << i << endl;using namespace std;int a[100001];int main(){int n, m, cnt, maxCnt, ans, j;while (scanf("%d", &n) != EOF){j = 0;cnt = 0;maxCnt = -1;ans = 0;scanf("%d", &a[0]);for (int i = 1; i < n; ++i){//cout << "j = " << j << endl;scanf("%d", &a[i]);if (a[j] < a[i]){cnt++; //比较次数+1}else{ cnt++; if (cnt > maxCnt){ maxCnt = cnt; ans = j;}j = i; cnt = 1; //不能恢复cnt为0!!!因为替换contendor时已比较一次}}if(cnt > maxCnt) ans = j;printf ("%d\n", ans + 1);} return 0;}