B'Allen wants to enter a fan zone that occupies a round square and has n entrances. There already is a queue of a_i people in front of the i -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: Determine the entrance through which Allen will finally enter the fan zone. The first line contains a single integer n ( 2 <= n <= 10^5 ) -- the number of entrances. The second line contains n integers a_1, a_2, ldots, a_n ( 0 <= a_i <= 10^9 ) -- the number of people in queues. These numbers do not include Allen. Print a single integer -- the number of entrance that Allen will use. In the first example the number of people (not including Allen) changes as follows: [ textbf{2}, 3, 2, 0] to [1, textbf{2}, 1, 0] to [0, 1, textbf{0}, 0] . The number in bold is the queue Alles stands in. We see that he will enter the fan zone through the third entrance. In the second example the number of people (not including Allen) changes as follows: [ textbf{10}, 10] to [9, textbf{9}] to [ textbf{8}, 8] to [7, textbf{7}] to [ textbf{6}, 6] to [5, textbf{5}] to [ textbf{4}, 4] to [3, textbf{3}] to [ textbf{2}, 2] to [1, textbf{1}] to [ textbf{0}, 0] . In the third example the number of people (not including Allen) changes as follows: [ textbf{5}, 2, 6, 5, 7, 4] to [4, textbf{1}, 5, 4, 6, 3] to [3, 0, textbf{4}, 3, 5, 2] to [2, 0, 3, textbf{2}, 4, 1] to [1, 0, 2, 1, textbf{3}, 0] to [0, 0, 1, 0, 2, textbf{0}] . '...