#include <bits/stdc++.h>
using namespace std;
int N;
int arr[200005];
int dp[200005];
int cnt = 1;
int maxCnt = 1;
int main() {
  memset(dp, -1, sizeof(dp));
  scanf("%d", &N);
  for (int i = 0; i < N; i++) {
    scanf("%d", &arr[i]);
  }
  for (int i = 0; i < N - 1; i++) {
    if (arr[i + 1] <= 2 * arr[i]) {
      cnt++;
      if (maxCnt <= cnt) {
        maxCnt = cnt;
      }
    } else {
      cnt = 1;
    }
  }
  printf("%d\n", maxCnt);
  return 0;
}
