#include <bits/stdc++.h>
using namespace std;
const int N = 3e5 + 5;
int n;
int a[N];
int pre[N], suf[N];
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cin >> n;
  for (int i = 1; i <= n; i++) cin >> a[i];
  memset(pre, 0x3f3f3f3f, sizeof(pre));
  memset(suf, 0x3f3f3f3f, sizeof(suf));
  for (int i = 1; i <= n; i++) pre[i] = min(pre[i - 1], a[i]);
  for (int i = n; i >= 1; i--) suf[i] = min(suf[i + 1], a[i]);
  int k = 1e9;
  for (int L = 1; L < n; L++) {
    int l = 1, r = 1 + L;
    if (r > n / 2 + 1) {
      int d = n - r + 1;
      int mn = min(pre[d], suf[n - d + 1]);
      k = min(k, mn / L);
    } else {
      k = min(k, pre[n] / L);
    }
  }
  cout << k;
  return 0;
}
