#include <bits/stdc++.h>
using namespace std;
void Solve() {
  int n, a[200005], maxx = -1e9;
  cin >> n;
  for (int i = (1); i <= (n); i++) cin >> a[i];
  int l = 0;
  a[0] = 1e9;
  for (int i = (1); i <= (n); i++) {
    if (a[i] <= 2 * a[i - 1])
      maxx = max(maxx, i - l);
    else
      l = i - 1;
  }
  cout << maxx;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int t = 1;
  while (t--) Solve();
}
