#include <bits/stdc++.h>
long long i, j, k = 1e12, n, p, r[300005];
int main() {
  for (scanf("%lld", &n); i < n; i++) {
    scanf("%lld", r + i);
    if (!r[i]) return puts("0");
  }
  for (i = 0; ++i < n;) {
    if (r[i] / i < k) k = r[i] / i;
  }
  for (i--; i--;) {
    if (r[i] / (n - i - 1) < k) k = r[i] / (n - i - 1);
  }
  printf("%lld", k);
}
