#include <bits/stdc++.h>
using namespace std;
clock_t begtime = clock();
void solve() {
  long long int n;
  cin >> n;
  long long int ans = n;
  vector<long long int> a(n), vis(n + 1, 0);
  for (long long int i = (0); i <= (n - 1); i++) {
    cin >> a[i];
  }
  sort(a.begin(), a.end());
  long long int p = 0, q = n / 2, j = 0;
  while (q < n && p < n) {
    if (vis[p]) {
      p++;
      continue;
    }
    while ((2 * a[p] > a[q] || vis[q]) && q < n) {
      q++;
    }
    if (q < n) {
      ans--;
      vis[p] = 1;
      vis[q] = 1;
      q++;
    }
    p++;
  }
  cout << ans;
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  solve();
  return 0;
}
