#include <bits/stdc++.h>
long long n;
long long a[200100];
long long l, r, mid;
long long sum = 0, ans;
long long u;
bool check(long long x) {
  long long cnt = 1, maxcnt = -1;
  long long nxt = 0;
  u = 2;
  nxt = a[1] * 2;
  while (u <= n) {
    if (a[u] <= nxt) {
      nxt = a[u] * 2;
      cnt++;
    } else {
      nxt = a[u] * 2;
      maxcnt = std ::max(maxcnt, cnt);
      cnt = 1;
    }
    u++;
  }
  maxcnt = std ::max(maxcnt, cnt);
  return maxcnt >= x;
}
int main(void) {
  scanf("%I64d", &n);
  for (int k = 1; k <= n; k++) scanf("%I64d", &a[k]), sum += a[k];
  l = 0, r = sum;
  while (l <= r) {
    mid = (l + r) >> 1;
    if (check(mid))
      l = mid + 1, ans = mid;
    else
      r = mid - 1;
  }
  printf("%I64d", ans);
  return 0;
}
