#include <bits/stdc++.h>
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("unroll-loops")
using namespace std;
const double pi =
    3.141592653589793238462643383279502884197169399375105820974944592307816406286208998628034825342;
const int MR = 3e5 + 10;
pair<int, int> t[MR];
int f[MR];
int main() {
  int n;
  scanf("%d", &n);
  vector<pair<int, int> > V;
  for (int i = 0; i < (n); ++i) {
    int a;
    scanf("%d", &a);
    V.push_back(make_pair(a, i));
  }
  sort(V.begin(), V.end());
  t[n] = make_pair(MR, -MR);
  for (int i = (n)-1; i >= (0); --i) {
    t[i] = t[i + 1];
    t[i].first = min(t[i].first, V[i].second);
    t[i].second = max(t[i].second, V[i].second);
  }
  for (int i = 0; i < (n); ++i) f[i] = 1e9 + 7;
  for (int i = 0; i < (n); ++i) {
    int dl = max(V[i].second - t[i].first, t[i].second - V[i].second);
    f[dl] = min(f[dl], V[i].first);
  }
  for (int i = 0; i < (n); ++i) {
    int dl = abs(i - V[0].second);
    f[dl] = V[0].first;
  }
  int res = V[0].first;
  for (int i = (1); i < (n); ++i) res = min(res, f[i] / i);
  printf("%d\n", res);
  return 0;
}
