#include <bits/stdc++.h>
using namespace std;
void fileioe() {
  freopen("input.txt", "r", stdin);
  freopen("output.txt", "w", stdout);
  freopen("error.txt", "w", stderr);
}
const int maxr = 5e5 + 5;
int n;
int arr[maxr];
bool ispossible(int x) {
  int i = 0, j = x;
  for (; j < n && i < x; j++, i++) {
    if (arr[j] * 2 > arr[i]) {
      return false;
    }
  }
  if (j == n) {
    return true;
  }
  return false;
}
int binary_search(int low, int high) {
  while (low < high) {
    int mid = (low + high) / 2;
    if (ispossible(mid)) {
      high = mid;
    } else {
      low = mid + 1;
    }
  }
  return low;
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  1;
  cin >> n;
  for (int i = 0; i < n; i++) {
    cin >> arr[i];
  }
  sort(arr, arr + n, greater<int>());
  cout << binary_search(1, n) << endl;
  return 0;
}
