#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f;
long long a[200000 + 5];
int main() {
  long long i, j, k, l;
  long long n, m;
  cin >> n;
  for (i = 0; i < n; i++) cin >> a[i];
  a[n] = 2000000009;
  long long maxn = 0;
  k = 0;
  for (i = 1; i <= n; i++) {
    if (a[i] > a[i - 1] * 2) {
      maxn = max(maxn, i - k);
      k = i;
    }
  }
  cout << maxn << endl;
}
