#include <bits/stdc++.h>
using namespace std;
int main() {
  int n;
  cin >> n;
  long long arr[n];
  for (int i = 0; i < n; i++) {
    cin >> arr[i];
  }
  sort(arr, arr + n);
  int m = 1;
  int max_so_far = 1;
  for (int i = 0; i < n - 1; i++) {
    if (2 * arr[i] >= arr[i + 1])
      max_so_far++;
    else
      max_so_far = 1;
    m = max(m, max_so_far);
  }
  cout << m << endl;
}
