#include <bits/stdc++.h>
using namespace std;
int main() {
  int n;
  cin >> n;
  long long a[n];
  map<long long, long long> m;
  for (int i = 0; i < n; i++) {
    cin >> a[i];
    m[a[i]] = i + 1;
  }
  long long Max = 0, count = 0;
  for (int i = 1; i < n; i++) {
    if (a[i] <= 2 * a[i - 1])
      count++;
    else
      count = 0;
    Max = max(count + 1, Max);
  }
  if (Max)
    cout << Max;
  else
    cout << 1;
}
