#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pli = pair<ll, int>;
using pil = pair<int, ll>;
void Solve() {
  int n;
  cin >> n;
  int a[n];
  for (int &v : a) cin >> v;
  int j = 1, len = 1;
  for (int i = 0; i < n; i++) {
    j = max(i + 1, j);
    while (j < n && a[j] <= 2 * a[j - 1]) j++;
    len = max(len, j - i);
  }
  cout << len << '\n';
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  Solve();
  return 0;
}
