#include <bits/stdc++.h>
long long int mod = 1000000007;
using namespace std;
long long int gcdExtended(long long int a, long long int b, long long int *x,
                          long long int *y) {
  if (a == 0) {
    *x = 0, *y = 1;
    return b;
  }
  long long int x1, y1;
  long long int gcd = gcdExtended(b % a, a, &x1, &y1);
  *x = y1 - (b / a) * x1;
  *y = x1;
  return gcd;
}
long long int modInverse(long long int a, long long int m) {
  long long int x, y;
  long long int g = gcdExtended(a, m, &x, &y);
  if (g != 1)
    return -1;
  else {
    long long int res = (x % m + m) % m;
    return res;
  }
}
long long int power(long long int x, long long int y, long long int p) {
  long long int res = 1;
  x = x % p;
  while (y > 0) {
    if (y & 1) res = (res * x) % p;
    y = y >> 1;
    x = (x * x) % p;
  }
  return res;
}
bool prime[1000002];
void sieve(long long int n) {
  memset(prime, true, sizeof(prime));
  for (int p = 2; p * p <= n; p++) {
    if (prime[p] == true) {
      for (int i = p * p; i <= n; i += p) prime[i] = false;
    }
  }
}
void rec(long long int **dp) {
  long long int i, j;
  for (i = 0; i < 100; i++)
    for (j = 0; j < 100; j++) dp[i][j] = 100;
}
long long int parent[100001], vis[100001];
long long int root(long long int pos) {
  while (pos != parent[pos]) pos = parent[pos];
  return pos;
}
void union1(long long int a, long long int b) {
  long long int root1 = root(a);
  long long int root2 = root(b);
  if (root1 != root2) parent[root1] = root2;
}
long long int traverse(long long int pos) {
  while (parent[pos] != pos) {
    vis[pos] = 1;
    pos = parent[pos];
  }
  return pos;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long int i = 0, j, kk = 0, k = 0, l, a, b = 0, r = 0, x, z, c = 0, d = 0,
                f, g, h, p, m, n, ans = 0, res = 0, prev = 0, last = 0,
                ma = -10e12, mi = 10e12, sum = 0, flag = 0, t;
  cin >> n;
  long long int v[n];
  for (i = 0; i < n; i++) cin >> v[i];
  c = 1;
  ans = 0;
  i = 1;
  while (i < n) {
    if (v[i] <= 2 * v[i - 1]) {
      c++;
    } else {
      ans = max(c, ans);
      c = 1;
    }
    i++;
  }
  ans = max(c, ans);
  cout << ans;
}
