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