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.
// import java.io.*;
// import java.util.*;

// public class C2 {
//     public static void main(String[] args) throws IOException {
//         BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
//         StringTokenizer st = new StringTokenizer(br.readLine());
//         int n = Integer.parseInt(st.nextToken());
//         int k = Integer.parseInt(st.nextToken());
//         if (n < (long) k * (k + 1) / 2 || k == 2 && n == 4 || k == 3 && n == 8) {
//             System.out.println("NO");
//             return;
//         }
//         System.out.println("YES");
//         if (k == 1) {
//             System.out.println(n);
//             return;
//         }
//         int[] aa = new int[1 + k];
//         n -= k * (k + 1) / 2;
//         int m = n / k, r = n % k;
//         for (int i = 1; i <= k; i++)
//             aa[i] = m + i + (i + r > k ? 1 : 0);
//         if (n == k - 1) {
//             aa[2]--;
//             aa[k]++;
//         }
//         StringBuilder sb = new StringBuilder();
//         for (int i = 1; i <= k; i++)
//             sb.append(aa[i] + " ");
//         System.out.println(sb);
//     }
// }package Round558;
// public class B1163{
// 	public static void main(String[] args) {
// 		Scanner sc=new Scanner(System.in);
// 		int n,i,ans=0,colour,max=0;
// 		n=sc.nextInt();
// 		int fr[]=new int[100001];
// 		int count[]=new int[100001];
// 		for(i=0;i<n;i++){
// 			colour=sc.nextInt();
// 			count[fr[colour]]--;
// 			fr[colour]++;
// 			count[fr[colour]]++;
// 			max=Math.max(max,fr[colour]);
// 			if((count[1]==i+1)
// 				||(count[i+1]==1)
// 				||((count[1]==1)&&((count[max]*max)==i))
// 				||((count[max]==1)&&(((count[max-1]+1)*(max-1))==i)))
// 				ans=i;
// 		}
// 		System.out.println(ans+1);
// 	}
// }
import java.util.Scanner;
public class A{
	public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int[] a = new int[n+1];
        for (int i = 1 ; i <= n ; i ++) {
            a[i]=sc.nextInt();
        }
        int min = Integer.MAX_VALUE;
        for (int i = 1 ; i <= n ; i ++) {
            int k;
            if (i<=n/2) k = Math.min(a[i],a[n])/(n-i);
            else k = Math.min(a[1],a[i])/(i-1);
            if (k<min) {
                min = k;
            }
        }
        System.out.println(min);
    }
}