#include <bits/stdc++.h>
using namespace std;
int main() {
  long long int n;
  cin >> n;
  vector<long long int> v(n);
  for (int i = 0; i < n; i++) {
    cin >> v[i];
  }
  long long int maxi = 1;
  long long int start = 0, end = 0;
  int i = 1;
  while (i < n) {
    if (v[i] > 2 * v[i - 1]) {
      maxi = max(maxi, end + 1 - start);
      start = end = i;
    } else
      end++;
    i++;
  }
  maxi = max(maxi, end + 1 - start);
  cout << maxi << endl;
  return 0;
}
