#include <bits/stdc++.h>
using namespace std;
void solve() {
  long long n;
  cin >> n;
  long long A[n];
  for (long long i = 0; i < n; i++) {
    cin >> A[i];
  }
  long long ans = 0;
  for (long long i = 0; i < n; i++) {
    long long j = i;
    while (j + 1 < n and A[j + 1] <= A[j] * 2) {
      ++j;
    }
    ans = max(ans, j - i + 1);
    i = j;
  }
  cout << ans << endl;
}
int main() {
  ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL);
  long long T = 1;
  while (T--) {
    solve();
  }
  return 0;
}
