#include <bits/stdc++.h>
using namespace std;
int main() {
  int n;
  cin >> n;
  vector<long long int> res(2 * (n - 1));
  for (int i = 0, j = 0; i < 2 * (n - 1), j < n; ++j) {
    long long int x;
    cin >> x;
    if (j != 0) {
      res[i] = (x / j);
      ++i;
    }
    if (j != n - 1) {
      res[i] = (x / (n - 1 - j));
      ++i;
    }
  }
  long long int r = 0;
  sort(res.begin(), res.end());
  cout << max(r, res[0]) << endl;
  return 0;
}
