#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9;
const int N = 3e5 + 1;
void solve() {
  int n;
  cin >> n;
  vector<int> v(n);
  for (auto &it : v) cin >> it;
  int cnt = 1, ans = 1;
  for (int i = 1; i < n; i++) {
    if (2 * v[i - 1] >= v[i])
      cnt++;
    else
      cnt = 1;
    ans = max(cnt, ans);
  }
  cout << ans;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  int t = 1;
  while (t--) solve();
  return 0;
}
