Let's call an array of non-negative integers a_1, a_2, …, a_n a k-extension for some non-negative integer k if for all possible pairs of indices 1 ≤ i, j ≤ n the inequality k ⋅ |i - j| ≤ min(a_i, a_j) is satisfied. The expansion coefficient of the array a is the maximal integer k such that the array a is a k-extension. Any array is a 0-expansion, so the expansion coefficient always exists.

You are given an array of non-negative integers a_1, a_2, …, a_n. Find its expansion coefficient.

Input

The first line contains one positive integer n — the number of elements in the array a (2 ≤ n ≤ 300 000). The next line contains n non-negative integers a_1, a_2, …, a_n, separated by spaces (0 ≤ a_i ≤ 10^9).

Output

Print one non-negative integer — expansion coefficient of the array a_1, a_2, …, a_n.

Examples

Input


4
6 4 5 5


Output


1

Input


3
0 1 2


Output


0

Input


4
821 500 479 717


Output


239

Note

In the first test, the expansion coefficient of the array [6, 4, 5, 5] is equal to 1 because |i-j| ≤ min(a_i, a_j), because all elements of the array satisfy a_i ≥ 3. On the other hand, this array isn't a 2-extension, because 6 = 2 ⋅ |1 - 4| ≤ min(a_1, a_4) = 5 is false.

In the second test, the expansion coefficient of the array [0, 1, 2] is equal to 0 because this array is not a 1-extension, but it is 0-extension.
#/* ---------itz_me9---------- */
#/* ---------ONLY GOD AND I KNOW WHAT I HAVE WRITTEN ----------*/
n=int(input())
v=list(map(int,input().split()))
tiff=0
fall=0
tuh=0
ti=0
m=n-1
#t1=min(a[0],a[n-1])/m;
#	mini=*(min_element(a.begin(),a.end()));
tiff=min(v[0],v[n-1])//m
mini=min(v)
mdist=-5
#fuck codeforces
for i in range(n):
	if(mini==v[i]):
		mdist=max(mdist,i,n-1-i)
fall=mini//mdist
l=999999999999999999
#t1=min(a[0],a[n-1])/m;
#	mini=*(min_element(a.begin(),a.end()));
tuh=mini
t5=999999999999999999
#you can go to GS
for i in range(1,n-1):
	tt1=min(v[0],v[i])//(i)
	tt2=min(v[n-1],v[i])//(n-1-i)
	t5=min(tt1,tt2,t5)
#print(t1,t2,t3)
ans=(max(min(tiff,fall,tuh,t5),0))
print(ans)