#include <bits/stdc++.h>
int inp() {
  char c = getchar();
  while (c < '0' || c > '9') c = getchar();
  int sum = 0;
  while (c >= '0' && c <= '9') {
    sum = sum * 10 + c - '0';
    c = getchar();
  }
  return sum;
}
std::set<int> s;
int id[300010], a[300010];
bool cmp(int x, int y) { return a[x] < a[y]; }
int main() {
  int n = inp();
  for (int i = 1; i <= n; i++) {
    a[i] = inp();
    id[i] = i;
    s.insert(i);
  }
  std::sort(id + 1, id + n + 1, cmp);
  int ans = 2147483647;
  for (int i = 1; i < n; i++) {
    int len = 0;
    if (*s.begin() != id[i]) len = std::max(len, id[i] - *s.begin());
    if (*s.rbegin() != id[i]) len = std::max(len, *s.rbegin() - id[i]);
    ans = std::min(ans, a[id[i]] / len);
    s.erase(s.find(id[i]));
  }
  printf("%d\n", ans);
}
