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