#include <bits/stdc++.h>
using namespace std;
vector<int> graph[100005];
int degree[100005];
bool visit[100005];
bool ok = false;
const int MAXN = 2e5 + 5;
const unsigned int M = 1000000007;
int main() {
  vector<long long> vec;
  int n, x;
  cin >> n;
  for (int i = 0; i < n; i++) {
    cin >> x;
    vec.push_back(x);
  }
  long long maxn = 1, size = 1;
  for (int i = 0; i < n - 1; i++) {
    if ((vec[i] * 2) >= vec[i + 1]) {
      size++;
    } else {
      size = 1;
    }
    maxn = max(maxn, size);
  }
  cout << maxn << "\n";
  return 0;
}
