#include <bits/stdc++.h>
using namespace std;
map<long long, vector<long long> > mp;
vector<long long> v;
bool cmp(long long a, long long b) { return v[a] > v[b]; }
int32_t main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ;
  long long n;
  cin >> n;
  for (long long i = 0, x; i < n; i++) {
    cin >> x, v.push_back(x);
    mp[x].push_back(i);
  }
  long long k = *min_element(v.begin(), v.end());
  for (map<long long, vector<long long> >::iterator it = mp.begin();
       it != mp.end(); it++) {
    vector<long long> &xv = it->second;
    if (xv.size() > 1)
      k = min(k, (it->first) / (*max_element(xv.begin(), xv.end()) -
                                *min_element(xv.begin(), xv.end())));
  }
  vector<long long> ids;
  for (long long i = 0; i < n; i++) ids.push_back(i);
  sort(ids.begin(), ids.end(), cmp);
  set<long long> st;
  for (long long i = 0; i < n; i++) {
    long long j = ids[i];
    long long z = v[j];
    if (!st.empty()) {
      long long x = *st.begin(), y = *(--st.end());
      k = min(k, min(z / abs(j - x), z / abs(j - y)));
    }
    st.insert(j);
  }
  cout << k << '\n';
  ;
}
