#include <bits/stdc++.h>
using namespace std;
int main() {
  long long int n, i, k;
  cin >> n;
  long long int ar[n + 1], min1 = 1e14, max1 = 0, max2 = 1e14, max3;
  vector<pair<long long int, long long int> > vec;
  for (i = 1; i <= n; i++) {
    cin >> ar[i];
    vec.push_back({ar[i], i});
  }
  sort(vec.begin(), vec.end());
  for (i = n - 1; i >= 0; i--) {
    if (i != n - 1) {
      max3 = max(abs(vec[i].second - min1), abs(vec[i].second - max1));
      max2 = min(max2, vec[i].first / max3);
    }
    min1 = min(min1, vec[i].second);
    max1 = max(max1, vec[i].second);
  }
  cout << max2;
}
