#include <bits/stdc++.h>
using namespace std;
int main() {
  long long int i = 0, n, c = 0, e, x, j, m, d, t = 0, sum = 0, f = 0, o, z = 0,
                h = 0, l = 0, k = 0, y, r, x1, x2, y1, y2;
  cin >> n;
  vector<long long int> v, v1;
  for (i = 0; i < n; i++) {
    cin >> x;
    v.push_back(x);
  }
  long long int a[n];
  a[0] = 1;
  l = 1;
  for (i = 1; i < n; i++) {
    if (v[i] <= 2 * v[i - 1]) {
      l++;
      a[i] = max(a[i - 1], l);
    } else {
      a[i] = a[i - 1];
      l = 1;
    }
  }
  cout << a[n - 1];
}
