#include <bits/stdc++.h>
using namespace std;
int n, nums[200200];
int main() {
  scanf("%d", &n);
  for (int i = 0; i < n; i++) scanf("%d", &nums[i]);
  int ans = 1;
  for (int i = 0; i < n; i++) {
    int p = i;
    while (p + 1 < n && nums[p + 1] <= 2 * nums[p]) p++;
    ans = max(ans, p - i + 1);
    i = p;
  }
  printf("%d\n", ans);
  return 0;
}
