#include <bits/stdc++.h>
using namespace std;
long long pow_mod(long long x, long long y) {
  long long r = 1;
  for (; y; y >>= 1, x = (long long)x * x % 1000000007)
    if (y & 1) r = (long long)r * x % 1000000007;
  return r;
}
int main() {
  int n;
  cin >> n;
  int a[n + 10];
  for (int i = 1; i <= n; i++) cin >> a[i];
  int ans = 1;
  int cnt = 1;
  for (int i = 1; i < n; i++) {
    if (a[i + 1] <= a[i] * 2)
      cnt++;
    else
      cnt = 1;
    ans = max(ans, cnt);
  }
  cout << ans;
}
