#include <bits/stdc++.h>
using namespace std;
int binarySearch(const vector<int>& vec, int minVal) {
  int L = 0, R = vec.size() - 1;
  int mid;
  while (L <= R) {
    mid = L + (R - L) / 2;
    if (vec[mid] == minVal) {
      return mid;
    }
    if (vec[mid] < minVal) {
      L = mid + 1;
    } else {
      R = mid - 1;
    }
  }
  if (mid < vec.size() - 2) {
    return mid + 1;
  }
  return -1;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int n;
  cin >> n;
  int ans = 0;
  vector<int> sizes(n);
  for (int i = 0; i < n; i++) {
    cin >> sizes[i];
  }
  sort(sizes.begin(), sizes.end());
  int j = 0;
  for (int i = 1; i < n; i++) {
    if (sizes[i] >= 2 * sizes[0]) {
      j = i;
      break;
    }
  }
  if (!j) {
    cout << n;
    return 0;
  }
  for (int i = 0; i < n / 2; i++) {
    while (j < n) {
      if (sizes[j] >= 2 * sizes[i]) {
        ans++;
        j++;
        break;
      }
      j++;
    }
  }
  cout << n - ans << endl;
  return 0;
}
