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.
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC optimize("O3")
using namespace std;
double mod(double a) { return (a < 0) ? -1 * a : a; }
long long int abs1(long long int a) { return (a < 0) ? -1 * a : a; }
void print(vector<long long int> v, int n) {
  for (long long int i = 0; i < n; i++) cout << v[i] << " ";
}
bool iP(long long int n) {
  if (n % 2 == 0 && n != 2) return 0;
  if (n == 2) return 1;
  for (long long int i = 3; i <= sqrt(n); i += 2) {
    if (n % i == 0) return 0;
  }
  return 1;
}
long long int gcd(long long int a, long long int b) {
  if (a == 0)
    return b;
  else
    return gcd(b % a, a);
}
int main() {
  int n;
  cin >> n;
  vector<long long int> a(n);
  for (auto& x : a) cin >> x;
  long long int k = -1;
  for (long long int i = 0; i < n; i++) {
    if (i > n - 1 - i) {
      if (k * (i) > min(a[0], a[i]) || k == -1) k = min(a[0], a[i]) / i;
    } else if (i < n - 1 - i) {
      if (k * (n - 1 - i) > min(a[n - 1], a[i]) || k == -1)
        k = min(a[n - 1], a[i]) / (n - 1 - i);
    } else {
      if (k * i > min(a[i], min(a[0], a[n - 1])) || k == -1)
        k = min(a[i], min(a[0], a[n - 1])) / i;
    }
  }
  cout << k << endl;
}
