#include <bits/stdc++.h>
using namespace std;
int n;
int arr[200005];
int dp[200005];
int main() {
  cin >> n;
  for (int i = 1; i <= n; i++) cin >> arr[i];
  dp[0] = 0;
  for (int i = 1; i <= n; i++) dp[i] = 2 * arr[i];
  int i = 1;
  int j = 2;
  int ans = 1;
  while (j <= n) {
    if (arr[j] <= dp[j - 1]) {
      ans = max(ans, j - i + 1);
    } else {
      i = j;
    }
    j++;
  }
  cout << ans << endl;
}
