#include <bits/stdc++.h>
using namespace std;
void solve() {
  long long n;
  cin >> n;
  long long a[n];
  for (long long i = 0; i < n; i++) cin >> a[i];
  long long len = 1;
  vector<long long> dp(n + 1, 1);
  for (long long i = 1; i < n; i++) {
    if (a[i] > 2 * a[i - 1] || a[i] == a[i - 1]) {
      dp[i] = 1;
    } else
      dp[i] = 1 + dp[i - 1];
    len = (len > dp[i] ? len : dp[i]);
  }
  cout << len;
}
int32_t main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  { solve(); }
  return 0;
}
