#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 10;
long long A[N];
int n;
int main() {
  cin >> n;
  for (int i = 0; i < n; i++) cin >> A[i];
  int ans = 1;
  int len = 1;
  for (int i = 1; i < n; i++) {
    if (A[i] <= 2 * A[i - 1])
      len++, ans = max(len, ans);
    else
      len = 1;
  }
  cout << ans << endl;
  return 0;
}
