#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 7;
int arr[maxn];
int dis[maxn];
int main() {
  int n;
  while (~scanf("%d", &n)) {
    for (int i = 0; i < n; i++) {
      scanf("%d", &arr[i]);
      dis[i] = 1;
    }
    int Max = 1;
    for (int i = 1; i < n; i++) {
      if (arr[i] <= arr[i - 1] * 2) {
        dis[i] = dis[i - 1] + 1;
      }
      Max = max(Max, dis[i]);
    }
    printf("%d\n", Max);
  }
  return 0;
}
