#include <bits/stdc++.h>
#pragma GCC optimize("O2")
using namespace std;
const int INF = int(2e9) + 99;
void test_case() {
  int n;
  cin >> n;
  vector<int> arr(n), ans;
  for (auto &x : arr) cin >> x;
  int mx = INT_MIN;
  for (int i = 0; i < n; i++) {
    int j = i;
    while (j + 1 < n && arr[j + 1] <= arr[j] * 2) j++;
    mx = max(mx, j - i + 1);
    i = j;
  }
  cout << mx << '\n';
  return;
}
int main() {
  cin.tie(0);
  ios_base::sync_with_stdio(false);
  int t = 1;
  while (t--) test_case();
  return 0;
}
