#include <bits/stdc++.h>
using namespace std;
int ind = 0;
vector<long long int> a;
int n;
bool F(long long int k) {
  long long int id = 0;
  for (int i = 0; i < n; i++) {
    if (k * id > a[i]) return false;
    id++;
  }
  id = 0;
  for (int i = n - 1; i >= 0; i--) {
    if (k * id > a[i]) return false;
    id++;
  }
  return true;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(NULL);
  cout.tie(NULL);
  cin >> n;
  a.resize(n);
  for (int i = 0; i < n; i++) cin >> a[i];
  long long int hi = 1e9 + 5, lo = 0, mid;
  while (hi - lo > 1) {
    mid = (hi + lo) / 2;
    if (F(mid))
      lo = mid;
    else
      hi = mid;
  }
  if (F(hi))
    cout << hi;
  else
    cout << lo;
  cout << '\n';
}
