#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, minN = INT_MAX, minNpos = -1;
  cin >> n;
  vector<int> a(n);
  vector<pair<int, int> > v;
  for (int i = 0; i < n; i++) {
    cin >> a[i];
    if (a[i] <= minN) {
      minN = a[i];
      minNpos = i;
    }
    v.push_back(make_pair(a[i], i));
  }
  int mi = INT_MAX;
  sort(v.begin(), v.end());
  for (int i = 0; i < v.size(); i++) {
    mi = min(mi, v[i].first / max(v[i].second, n - v[i].second - 1));
  }
  cout << mi << endl;
  return 0;
}
