#include <bits/stdc++.h>
using namespace std;
const long long N = 1e4 + 1;
const long long INF = 1e18;
long long n, m, l, k, x, y, z, cnt, ans, sum, mx, mn = INF, u[N];
vector<long long> v;
deque<long long> d;
string s, t;
int main() {
  ios_base::sync_with_stdio(0);
  ;
  cin >> n;
  for (int i = 0; i < n; i++) cin >> l, v.push_back(l);
  for (int i = 0; i < n - 1; i++) {
    if (v[i] * 2 >= v[i + 1])
      cnt++, mx = max(mx, cnt);
    else
      cnt = 0;
  }
  cout << mx + 1;
}
