#include <bits/stdc++.h>
using namespace std;
template <class c>
struct rge {
  c b, e;
};
template <class c>
rge<c> range(c i, c j) {
  return rge<c>{i, j};
}
template <class c>
auto dud(c* x) -> decltype(cerr << *x, 0);
template <class c>
char dud(...);
struct debug {
  template <class c>
  debug& operator<<(const c&) {
    return *this;
  }
};
long long __pow(long long x, long long y, long long M) {
  long long res = 1;
  while (y > 0) {
    if (y & 1) res = (res * x) % M;
    y >>= 1;
    x = (x * x) % M;
  }
  return res % M;
}
long long __pow(long long x, long long y) {
  long long res = 1;
  while (y > 0) {
    if (y & 1) res = (res * x);
    y >>= 1;
    x = (x * x);
  }
  return res;
}
long long gcd(long long a, long long b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
const long long N = 2e5 + 2, inf = 1e18, M = 1e9 + 7;
long long test, n, m, a, b, query;
bool ok = 1;
void test_case() {
  cin >> n;
  vector<long long> a(n);
  for (long long& x : a) cin >> x;
  long long k = inf;
  for (long long i = 0; i < n; i++) {
    if (i) k = min(k, a[i] / i);
    if (i != n - 1) k = min(k, a[i] / (n - 1 - i));
  }
  cout << k << endl;
}
int32_t main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  test = 1;
  while (test--) test_case();
  return 0;
}
