#include <bits/stdc++.h>
using namespace std;
const int N = 1e6;
long long int modd = 998244353;
vector<bool> isprime(N + 1, true);
void seive() {
  isprime[0] = false;
  isprime[1] = false;
  for (int i = 2; i * i <= 1e6; i++) {
    if (isprime[i]) {
      for (int j = i * i; j <= 1e6; j += i) {
        isprime[j] = false;
      }
    }
  }
}
int findfrnd(bitset<32> x, bitset<32> y, int q) {
  int p = 0;
  for (int i = 0; i < 32; i++) {
    if (x[i] != y[i]) {
      p++;
      if (p > q) return 0;
    }
  }
  return 1;
}
long long int moduleinverse(long long int x) {
  long long int res = 1;
  long long int y = 1000000007 - 2;
  x = x % 1000000007;
  while (y > 0) {
    if (y & 1) res = (res * x) % 1000000007;
    y /= 2;
    x = (x * x) % 1000000007;
  }
  return res;
}
long long int ispossible(long long int a[], long long int n,
                         long long int amount, long long int k) {
  long long int b[n], sum = 0;
  for (int i = 0; i < n; i++) {
    b[i] = a[i] + k * (i + 1);
  }
  sort(b, b + n);
  for (int i = 0; i < k; i++) {
    sum += b[i];
  }
  if (sum <= amount)
    return sum;
  else
    return -1;
}
long long int dp[2000];
void fact() {
  dp[0] = 1;
  for (int i = 1; i < 2000; i++) {
    dp[i] = (dp[i - 1] * i) % 1000000007;
  }
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout << fixed << setprecision(10);
  seive();
  int n;
  cin >> n;
  int a[n];
  for (int i = 0; i < n; i++) {
    cin >> a[i];
  }
  sort(a, a + n);
  int i = 0;
  int j = n / 2;
  int ans = n;
  while (i < n / 2 && j < n) {
    if (a[i] * 2 <= a[j]) {
      ans--;
      i++;
      j++;
    } else {
      j++;
    }
  }
  cout << ans << endl;
  return 0;
}
