#include <bits/stdc++.h>
using namespace std;
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n;
  cin >> n;
  vector<int> a(n);
  for (auto &in : a) cin >> in;
  queue<pair<int, int>> q;
  multiset<pair<int, int>> d;
  int res = 1;
  for (int i = 0; i < n; ++i) {
    while (!q.empty() && 2 * q.front().first < a[i]) {
      d.erase({q.front().second, q.front().first});
      q.pop();
    }
    int dp = 1;
    if (!d.empty()) {
      dp += d.rbegin()->first;
      res = max(res, dp);
    }
    d.insert({dp, a[i]});
    q.push({a[i], dp});
  }
  cout << res << endl;
  return 0;
}
