#include <bits/stdc++.h>
using namespace std;
void solve() {
  int n;
  cin >> n;
  vector<int> v(n);
  map<int, int> mp;
  for (int i = 0; i < n; i++) {
    cin >> v[i];
    mp[i + 1] = 1;
  }
  int count = 1;
  int maxi = 1;
  for (int i = 1; i < n; i++) {
    if (v[i] <= 2 * v[i - 1]) {
      mp[count]++;
      maxi = max(maxi, mp[count]);
    } else
      count++;
  }
  cout << maxi << "\n";
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int t;
  t = 1;
  while (t--) {
    solve();
  }
  return 0;
}
