#include <bits/stdc++.h>
using namespace std;
const long long MAX5 = 1e5 + 1;
const long long MAX6 = 1e6 + 1;
const long long MAX7 = 1e7 + 1;
const long long MOD = 1e9 + 7;
const long long INF = 1e18;
void problem_solver() {
  long long n;
  cin >> n;
  vector<long long> a(n), pre(n + 1), suf(n + 1);
  for (long long i = 0; i < n; i++) {
    cin >> a[i];
    pre[i] = 1;
    suf[i] = 1;
  }
  for (long long i = 1; i < n; i++) {
    if (a[i] <= (2 * a[i - 1])) {
      pre[i] = pre[i - 1] + 1;
    }
  }
  for (long long i = n - 2; i >= 0; i--) {
    if (2 * a[i] >= a[i + 1]) {
      suf[i] = suf[i + 1] + 1;
    }
  }
  long long ans = 0;
  for (long long i = 0; i < n; i++) {
    ans = max(ans, (pre[i] + suf[i] - 1));
  }
  cout << ans;
}
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  cout.tie(nullptr);
  long long t = 1;
  while (t--) {
    problem_solver();
    cout << '\n';
  }
}
