#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e6 + 10;
int n, a[maxn];
int fin(int x) {
  int val = 2 * x;
  int l = 0, r = n;
  while (l <= r) {
    int mid = (l + r) / 2;
    if (val == a[mid])
      return mid;
    else if (val > a[mid])
      l = mid + 1;
    else
      r = mid - 1;
  }
  return r;
}
int main() {
  cin >> n;
  for (int i = 1; i <= n; i++) cin >> a[i];
  sort(a + 1, a + n + 1);
  int j = n;
  int ans = 0;
  for (int i = (n) / 2; i >= 1; i--) {
    if (a[i] * 2 <= a[j]) {
      ans++;
      j--;
    }
  }
  cout << n - ans << endl;
}
