Description

Allen wants to enter a fan zone that occupies a round square and has nn entrances.

There already is a queue of aiai people in front of the ii-th entrance. Each entrance allows one person from its queue to enter the fan zone in one minute.

Allen uses the following strategy to enter the fan zone:

• Initially he stands in the end of the queue in front of the first entrance.
• Each minute, if he is not allowed into the fan zone during the minute (meaning he is not the first in the queue), he leaves the current queue and stands in the end of the queue of the next entrance (or the first entrance if he leaves the last entrance).

Determine the entrance through which Allen will finally enter the fan zone.

Input

The first line contains a single integer nn (2≤n≤1052≤n≤105) — the number of entrances.

The second line contains nn integers a1,a2,…,ana1,a2,…,an (0≤ai≤1090≤ai≤109) — the number of people in queues. These numbers do not include Allen.

Output

Print a single integer — the number of entrance that Allen will use.

Sample Input

Input

4
2 3 2 0

Output

3

Input

2
10 10

Output

1

Input

6
5 2 6 5 7 4

Output

6 

题意：圆形球场有n个门，Allen想要进去看比赛。Allen采取以下方案进入球场：开始Allen站在第一个门，如果当前门前面有人Allen会花费单位时间走到下一个门，如果没人Allen从这个门就进去了。球场的每个门，每单位时间可以进去一个人。问Allen最终是从哪个门进入球场的？

思路：赛后TD讲才知道有规律可循，假设第i个门一开始有a个人，k是走过的圈数即第k圈可进入，推出一道公式k∗n+i=a，求最小k所对应的i即可（注意求k的时候a-i可能小于0，这时候都加上n，不影响最后结果，这里比较费劲得理解一下）

 ac代码：

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<string>
#include<cmath>
#include<iomanip>
#include<map>
#include<vector>
#include<queue>
#include<set>
#include<algorithm>
using namespace std;
typedef long long int LL;
const int MAXN=1e5+10;
const int INF = 0x3f3f3f3f;
int main()
{
    int n,a,ans,min1;
    scanf("%d",&n);
    min1=INF;
    for(int i=1;i<=n;i++)
    {
        scanf("%d",&a);
        int x=a-i+n;
        
        if(min1>x/n)
        {
            min1=x/n;
            ans=i;
        }
    }
    printf("%d\n",ans);

}

 ----------------------------------------------------------------------------我是分割线-----------------------------------------------------------------------------------------

比赛时用周期做没a，很吐血的是开了long long 后来改成int 原封不动的提交a了，太恶心了妈的！！！！！！！

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<string>
#include<cmath>
#include<iomanip>
#include<map>
#include<vector>
#include<queue>
#include<set>
#include<algorithm>
using namespace std;
typedef long long int LL;
const int MAXN=1e5+10;
int a[MAXN];
int main()
{
    int  n,i,j,x,t,flag,ans;
    scanf("%d",&n);
    for(i=1; i<=n; i++)
    {
        scanf("%d",&a[i]);
    }
    x=0;
    for(i=1;i<=n;)
    {
        t=a[i]-x;
        if(t<=0)
        {
            flag=i;
            break;
        }

        else
        {
            if(i==n)
            {
                i=1;
                x++;
                continue;
            }
            else
            {
                i++;
                x++;
                continue;
            }
        }
    }
    printf("%d\n",flag);
    return 0;
}