#include <bits/stdc++.h>
using namespace std;
const int N = 5 * 100002;
int size;
int ara[N];
map<int, int> mp;
int cnt;
bool B_search(int n) {
  int kaka = -1;
  int low = 0;
  int high = size - 1;
  int ans = INT_MAX;
  while (high - low < 5) {
    int mid = (high + low) / 2;
    if (n * 2 <= ara[mid] and mp[mid] == 0) {
      kaka = mid;
      ans = ara[mid];
      high = mid - 1;
    } else
      low = mid + 1;
  }
  for (int i = low; i <= high; i++) {
    if (ara[i] >= n * 2 and ara[i] < ans and mp[i] == 0) {
      ans = ara[i];
      kaka = i;
    }
  }
  mp[kaka] = 1;
  if (ans == INT_MAX) return 0;
  return 1;
}
int counts;
int main() {
  int n;
  cin >> size;
  for (int i = 0; i < size; i++) {
    cin >> ara[i];
  }
  sort(ara, ara + size);
  int i = 0;
  int j = size / 2;
  while (i < size / 2 and j < size) {
    if (ara[i] * 2 <= ara[j]) {
      i++, j++, cnt++;
    } else
      j++;
  }
  cout << size - cnt << endl;
  return 0;
}
