#include <bits/stdc++.h>
using namespace std;
int a[200005];
int main() {
  int n;
  scanf("%d", &n);
  for (int i = 0; i < n; i++) scanf("%d", &a[i]);
  int lptr = 0, rptr = 0, res = 1, prev = 0;
  while (rptr < n) {
    res = max(res, rptr - lptr + 1);
    prev = rptr;
    rptr++;
    if (2 * a[prev] < a[rptr]) lptr = rptr;
  }
  printf("%d\n", res);
  return 0;
}
