#include <bits/stdc++.h>
using namespace std;
const long long N = 300005;
int n, x;
int v[300100];
vector<int> a;
using namespace std;
int ce(int a, int b) { return (a + b - 1) / b; }
int main() {
  scanf("%d", &n);
  int k;
  for (int i = 0; i < n; ++i) {
    scanf("%d", &v[i]);
  }
  int ans = 1000000001, tmp1, tmp2;
  for (int i = 0; i < n; ++i) {
    i ? tmp1 = min(v[i], v[0]) / i : tmp1 = 1000000001;
    i < n - 1 ? tmp2 = min(v[i], v[n - 1]) / abs(n - 1 - i) : tmp2 = 1000000001;
    k = min(tmp1, tmp2);
    ans = min(ans, k);
  }
  printf("%d\n", ans);
  return 0;
}
