#include <bits/stdc++.h>   using namespace std;   vector<pair<long long int, long long int>> v1;   int main() {     long long int n, i, A[300005], minn, t1, a1, i1;     cin >> n;     for (i = 1; i <= n; i++) {       cin >> A[i];       v1.push_back(make_pair(A[i], i));     }     minn = 10000000000;     for (i = 2; i <= n; i++) {       t1 = min(A[1], A[i]) / (i - 1);       if (t1 < minn) minn = t1;     }     for (i = n - 1; i >= 1; i--) {       t1 = min(A[n], A[i]) / (n - i);       if (t1 < minn) minn = t1;     }     sort(v1.begin(), v1.end());     a1 = v1[0].first;     i1 = v1[0].second;     for (i = 1; i < v1.size(); i++) {       t1 = min(a1, v1[i].first) / (abs(i1 - v1[i].second));       if (t1 < minn) minn = t1;     }     cout << minn << endl;     return 0;   }   