#include <bits/stdc++.h>
using namespace std;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int n;
  cin >> n;
  vector<pair<int, int> > v;
  int usedInd[n];
  for (int i = 0; i < n; i++) {
    int c;
    cin >> c;
    v.push_back(make_pair(c, i));
    usedInd[i] = 0;
  }
  std::sort(v.begin(), v.end());
  int k = 1000000001;
  int mnInd = 0;
  int mxInd = n - 1;
  for (int i = 0; i < v.size(); i++) {
    pair<int, int> cur = v[i];
    int value = cur.first;
    int ind = cur.second;
    if (max(ind - mnInd, mxInd - ind) == 0) {
      continue;
    }
    k = min(k, value / max(ind - mnInd, mxInd - ind));
    usedInd[ind] = 1;
    if (ind == mxInd) {
      while (mxInd >= 0 && usedInd[mxInd] != 0) {
        mxInd--;
      }
    }
    if (ind == mnInd) {
      while (mnInd < n && usedInd[mnInd] != 0) {
        mnInd++;
      }
    }
  }
  cout << k;
  return 0;
}
