#include <bits/stdc++.h>
#pragma GCC optimize("Ofast,no-stack-protector")
#pragma GCC target("avx2")
using namespace std;
inline int read() {
  int x = 0, f = 1;
  char ch = getchar();
  while (ch < '0' || ch > '9') {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') {
    x = 10 * x + ch - '0';
    ch = getchar();
  }
  return x * f;
}
long long gcd(long long x, long long y) { return y ? gcd(y, x % y) : x; }
long long power(long x, long y) {
  long long t = 1;
  for (; y; y >>= 1, x = x * x % (998244353))
    if (y & 1) t = t * x % (998244353);
  return t;
}
int a[(1000000 + 5)];
int main() {
  int n = read(), t, ans = 0;
  for (int i = 1; i <= n; i++) {
    a[i] = read();
    if (i == 1 || a[i] > 2 * a[i - 1])
      t = 1;
    else
      t++;
    ans = max(ans, t);
  }
  cout << ans << endl;
  return 0;
}
