#include <bits/stdc++.h>
using namespace std;
bool comp(pair<int, int>& a, pair<int, int>& b) {
  if (a.first == b.first)
    return a.second < b.second;
  else
    return a.first > b.first;
}
int main() {
  int n, x;
  cin >> n;
  vector<pair<int, int>> v;
  for (int i = 1; i <= n; i++) {
    cin >> x;
    v.push_back(make_pair(x, i));
  }
  sort(v.begin(), v.end(), comp);
  int mi = n, me = 1;
  int ans = INT_MAX;
  mi = min(v[0].second, mi);
  mi = max(v[0].second, me);
  for (int i = 1; i < n; i++) {
    int g = max(abs(v[i].second - mi), abs(v[i].second - me));
    ans = min(ans, v[i].first / g);
    mi = min(v[i].second, mi);
    me = max(v[i].second, me);
  }
  cout << ans << endl;
}
