#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, l = 0;
  cin >> n;
  long long int x, p, k = 1000000001;
  vector<pair<long long int, long long int> > a;
  for (int i = 0; i < n; i++) {
    cin >> x;
    if (x == 0) l = 1;
    a.push_back(make_pair(x, i + 1));
  }
  if (l)
    cout << 0;
  else {
    sort(a.begin(), a.end());
    for (auto i = 0; i < n; i++) {
      p = max(a[i].second - 1, n - a[i].second);
      p = a[i].first / p;
      if (p < k) k = p;
    }
    cout << k;
  }
  return 0;
}
