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