#include <bits/stdc++.h>
using namespace std;
const int maxn = 3e5 + 5;
long long a[maxn];
int main() {
  long long n;
  while (cin >> n) {
    for (int i = 1; i <= n; i++) {
      cin >> a[i];
    }
    long long cnt = 1, ans = 1;
    for (int i = 2; i <= n; i++) {
      if (a[i] <= a[i - 1] * 2)
        cnt++;
      else
        ans = max(ans, cnt), cnt = 1;
    }
    ans = max(ans, cnt);
    cout << ans << '\n';
  }
}
