#include <bits/stdc++.h>
using namespace std;
long long i, j, k, l, n, m, r, len, res;
long long a[200009], d[200009];
int main() {
  cin >> n;
  for (i = 1; i <= n; i++) {
    cin >> a[i];
  }
  l = 1;
  r = 1;
  len = 1;
  res = 1;
  while (l <= n && r <= n) {
    if (r == n) break;
    if (2 * a[r] >= a[r + 1]) {
      len++;
      r++;
    } else {
      l = r + 1;
      r = r + 1;
      len = 1;
    }
    res = max(res, len);
  }
  cout << res << endl;
  return 0;
}
