#include <bits/stdc++.h>
using namespace std;
int main() {
  int n;
  cin >> n;
  int a[n];
  for (int i = 1; i <= n; i++) cin >> a[i];
  int dp[n];
  dp[1] = 2 * a[1];
  for (int i = 2; i <= n; i++) dp[i] = 2 * a[i];
  vector<int> v;
  int cnt = 0;
  for (int i = n; i > 1; i--) {
    if (a[i] <= dp[i - 1])
      cnt++;
    else {
      cnt++;
      v.push_back(cnt);
      cnt = 0;
    }
  }
  v.push_back(cnt + 1);
  sort(v.begin(), v.end());
  int sz = v.size();
  cout << v[sz - 1] << endl;
}
