#include <bits/stdc++.h>
using namespace std;
const int inf = 0x3f3f3f3f;
const int maxn = 3e5 + 10;
struct aa {
  int val, num;
  aa() {}
};
aa arr[maxn];
int arr1[maxn];
bool cmp(aa a, aa b) { return a.val < b.val; }
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int n;
  cin >> n;
  for (int i = 0; i < n; i++) {
    cin >> arr[i].val;
    arr1[i] = arr[i].val;
    arr[i].num = i;
  }
  sort(arr, arr + n, cmp);
  int k = inf;
  for (int i = 0; i < n; i++) {
    if (arr[i].num != 0) {
      k = min(k, min(arr[i].val, arr1[0]) / arr[i].num);
    }
    if (arr[i].num != n - 1) {
      k = min(k, min(arr[i].val, arr1[n - 1]) / (n - 1 - arr[i].num));
    }
  }
  cout << k << endl;
}
