For this Question: Sara is playing a game in which there are N monsters standing in a circle and the ith (1 <= i <= N) monster has A[i] HP.
Rules:-
At the end of each second, all the monster's HP decreases by 1 if it is not 0. 
At the end of each second, the player will jump to the next monster (monster standing to the right of the current).
The game ends when the current monster has 0 health.

If the player starts at index 1 then find the index at which the game ends.First line of input contains a single integer N. The next line of input contains N space-separated integers depicting the values of the array.

Constraints:-
1 <= N <= 100000
0 <= A[i] <= 1000000000Print a single index at which the game ends.Sample Input:-
5
3 2 3 2 1

Sample Output:-
4

Explanation:-
[ 3(P), 2, 3, 2, 1] - > [2, 1(P), 2, 1, 0] - > [1, 0, 1(P), 0, 0 ] - > [0, 0, 0, 0(P), 0]

Sample Input:-
3
10 10 10

Sample Output:-
2, I have written this Solution Code: n = int(input())
a = list(map(int,input().split()))
i=0
while(True):
    if(a[i%n]-i<=0):
        print(i%n+1)
        break
    i+=1, In this Programming Language: Python, Now tell me if this Code is compilable or not?