#include <bits/stdc++.h>
using namespace std;
int n, a[200005], ans, head = 1;
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; ++i) scanf("%d", &a[i]);
  if (n == 1) {
    puts("1");
    return 0;
  }
  for (int i = 2; i <= n; ++i)
    if (a[i] > (a[i - 1] << 1)) ans = max(ans, i - head), head = i;
  if (a[n] <= (a[n - 1] << 1)) ans = max(ans, n - head + 1);
  cout << ans << endl;
  return 0;
}
