#include <bits/stdc++.h>
using namespace std;
const int maxx = 1e6 + 19;
long long b[maxx], c[maxx], d, ans, jvb,
    minn = 99999999999, maxn = -999999999999, n, m, x, y, dp[maxx], k, sum, z,
    a[maxx];
vector<int> v;
string s;
bool flag = true;
void Input() {
  cin >> n;
  for (int i = 0; i < n; i++) cin >> a[i];
}
void Solve() {
  dp[0] = 1;
  for (int i = 1; i < n; i++) {
    if (a[i] > a[i - 1] * 2)
      dp[i] = 1;
    else if (a[i] <= a[i - 1] * 2)
      dp[i] = dp[i - 1] + 1;
  }
  sort(dp, dp + n);
  cout << dp[n - 1] << endl;
}
int main() {
  ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
  Input(), Solve();
  return 0;
}
