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