#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7, A = 1e6 + 5;
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long n;
  cin >> n;
  long long a[n + 1], x, ans = 1e18;
  long long mn1 = 1e18, ind1, mn2 = 1e18, ind2;
  for (int i = 0; i < n; i++) {
    cin >> a[i];
    if (mn1 > a[i]) mn1 = a[i], ind1 = i;
    if (mn2 >= a[i]) mn2 = a[i], ind2 = i;
  }
  if (mn1 == 0) return cout << 0, 0;
  for (int i = 0; i < n; i++) {
    if (ind1 == i) continue;
    x = mn1 / abs(ind1 - i);
    ans = min(ans, x);
  }
  for (int i = 0; i < n; i++) {
    if (ind2 == i) continue;
    x = mn2 / abs(ind2 - i);
    ans = min(ans, x);
  }
  for (int i = 0; i < n - 1; i++) {
    x = min(a[n - 1], a[i]) / (n - 1 - i);
    ans = min(ans, x);
  }
  for (int i = 1; i < n; i++) {
    x = min(a[0], a[i]) / i;
    ans = min(ans, x);
  }
  cout << ans;
  return 0;
}
