Vika has *n* jars with paints of distinct colors. All the jars are numbered from 1 to *n* and the *i*-th jar contains *a*<sub class="lower-index">*i*</sub> liters of paint of color *i*.

Vika also has an infinitely long rectangular piece of paper of width 1, consisting of squares of size 1 × 1. Squares are numbered 1, 2, 3 and so on. Vika decided that she will start painting squares one by one from left to right, starting from the square number 1 and some arbitrary color. If the square was painted in color *x*, then the next square will be painted in color *x* + 1. In case of *x* = *n*, next square is painted in color 1. If there is no more paint of the color Vika wants to use now, then she stops.

Square is always painted in only one color, and it takes exactly 1 liter of paint. Your task is to calculate the maximum number of squares that might be painted, if Vika chooses right color to paint the first square.
The first line of the input contains a single integer *n* (1 ≤ *n* ≤ 200 000) — the number of jars with colors Vika has.

The second line of the input contains a sequence of integers *a*<sub class="lower-index">1</sub>, *a*<sub class="lower-index">2</sub>, ..., *a*<sub class="lower-index">*n*</sub> (1 ≤ *a*<sub class="lower-index">*i*</sub> ≤ 10<sup class="upper-index">9</sup>), where *a*<sub class="lower-index">*i*</sub> is equal to the number of liters of paint in the *i*-th jar, i.e. the number of liters of color *i* that Vika has.
In the first sample the best strategy is to start painting using color 4. Then the squares will be painted in the following colors (from left to right): 4, 5, 1, 2, 3, 4, 5, 1, 2, 3, 4, 5.

In the second sample Vika can start to paint using any color.

In the third sample Vika should start painting using color number 5.
5
2 4 2 3 3
12
3
5 5 5
15
6
10 10 10 1 10 10
11
1
167959139
167959139
10
896619242 805194919 844752453 848347723 816995848 856813612 805194919 833406689 816255448 805194919
8051949194
2
2 3
5
2
10 10
20
2
1111 1110
2221
3
100 101 100
301
3
100 100 101
301
3
101 100 100
301
4
2 3 2 2
9
4
1 1 1 1
4
4
100 100 100 101
401
4
101 100 100 101
402
4
100 101 101 100
402
4
200 201 200 201
801
4
201 200 201 200
801
4
300 302 302 300
1202
8
5 4 3 2 1 1 1 1
12
8
2 2 1 2 2 1 2 2
12
10
2 1 2 1 2 2 2 2 2 1
15
13
2 2 2 1 1 1 1 1 1 1 2 2 2
19
t = int(input())
data = [int(i) for i in input().split(' ')]
datamin = min(data)
data = [i - datamin for i in data]
maxn = 0
cont = 0
for i in data:
    if i == 0:
        maxn = max(maxn, cont)
    else:
        cont += 1
print(maxn + datamin * t)

	 							   	    	  	  		 	 	 	