#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 11;
int n;
int a[N], f[N];
int BinSearch(int x, int k) {
  int head = 0, tail = k - 1;
  while (head <= tail) {
    int mid = (head + tail) / 2;
    if (a[mid] * 2 < x) head = mid + 1;
    if (a[mid] * 2 >= x) {
      if (mid == 0 || a[mid - 1] * 2 < x) return mid;
      tail = mid - 1;
    }
  }
  return k;
}
int main() {
  memset(f, 0, sizeof(f));
  scanf("%d", &n);
  for (int i = 0; i < n; i++) {
    scanf("%d", &a[i]);
    f[i] = 1;
  }
  int res = 1;
  for (int i = 1; i < n; i++) {
    int index = BinSearch(a[i], i);
    int PreNum = 0;
    if (i != index) PreNum = f[index];
    int r = i - index + PreNum;
    if (i != index) f[i] = r;
    res = max(res, r);
  }
  printf("%d\n", res);
  return 0;
}
