#include <bits/stdc++.h>
using namespace std;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long n;
  cin >> n;
  long long a[n];
  for (long long i = 0; i < n; i++) cin >> a[i];
  long long mx = 0;
  for (long long i = 0; i < n; i++) {
    long long j = i;
    long long k = 0;
    while (true) {
      long long x = lower_bound(a, a + n, 2 * a[j]) - a;
      if (a[x] > 2 * a[j]) x--;
      if (x == j or a[x] > 2 * a[j])
        break;
      else if (a[x] <= 2 * a[j]) {
        if (x >= n)
          k += n - j;
        else
          k += x - j;
      }
      j = x;
      if (j >= n) break;
    }
    mx = max(mx, k + 1);
  }
  mx = max(mx, (long long)1);
  cout << mx;
  return 0;
}
