#include <bits/stdc++.h>
const int maxn = 3e5 + 7;
const int inf = 0x3f3f3f3f;
const long long mod = 1e9 + 7;
using namespace std;
int a[maxn], n;
int main() {
  scanf("%d", &n);
  for (int i = 0; i < n; i++) {
    scanf("%d", &a[i]);
  }
  int ans = inf;
  for (int i = 1; i < n; i++) {
    int tem = min(a[0], a[i]);
    ans = min(ans, tem / i);
    if (i == n - 1) break;
    tem = min(a[i], a[n - 1]);
    ans = min(ans, tem / (n - 1 - i));
  }
  printf("%d\n", ans);
  return 0;
}
