#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f;
const int N = 3e5 + 10;
const long long mod = 998244353;
const double PI = acos(-1);
inline int ab(int x) { return x < 0 ? -x : x; }
inline int mm(int x, int p) { return x >= p ? x - p : x < 0 ? x + p : x; }
int main() {
  int n, ans = 0, now = 0, pre = INF;
  scanf("%d", &n);
  for (int i = 1, x; i <= n; ++i) {
    scanf("%d", &x);
    if (x > pre * 2) {
      ans = max(ans, now);
      pre = x;
      now = 1;
    } else {
      now++;
      pre = x;
    }
  }
  ans = max(ans, now);
  printf("%d", ans);
  return 0;
}
