#include <bits/stdc++.h>
using namespace std;
long long nMod = 1e9 + 7;
inline long long GCD(long long a, long long b) {
  while (b != 0) {
    long long c = a % b;
    a = b;
    b = c;
  }
  return a;
};
inline long long LCM(long long a, long long b) { return (a / GCD(a, b)) * b; };
int n;
int arr[300005];
int res = 1000000007;
void vietnakid() {
  cin >> n;
  for (int i = 0; i < n; i++) {
    cin >> arr[i];
    int k = 1000000007;
    if (i != 0) k = min(k, arr[i] / i);
    if (i != n - 1) k = min(k, arr[i] / (n - i - 1));
    res = min(res, k);
  }
  cout << res << "\n";
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie();
  vietnakid();
  cerr << "\nTime elapsed: " << 1000 * clock() / CLOCKS_PER_SEC << "ms\n";
  return 0;
}
