#include <bits/stdc++.h>
using namespace std;
const int maxn = 300000 + 5;
int a[maxn];
int main() {
  int n;
  cin >> n;
  int mn = 0x3f3f3f3f;
  for (int i = 1; i <= n; i++) {
    scanf("%d", &a[i]);
    mn = min(a[i], mn);
  }
  int ans = 0x3f3f3f3f;
  for (int i = 1; i <= n; i++) {
    if (i != 1) ans = min(min(a[i], a[1]) / abs(1 - i), ans);
    if (i != n) ans = min(min(a[i], a[n]) / abs(n - i), ans);
  }
  cout << ans << endl;
  return 0;
}
