#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 20;
int kzoo[N * 5];
int vis[N * 5];
int tmp(int a, int b) { return a < b; }
int main() {
  int n;
  while (cin >> n) {
    memset(vis, 0, sizeof(vis));
    int m = 0;
    if (n % 2 == 0) {
      m = n / 2;
    } else {
      m = (n - 1) / 2;
    }
    int ans = n;
    for (int i = 0; i < n; i++) {
      cin >> kzoo[i];
    }
    sort(kzoo, kzoo + n, tmp);
    int j = 0;
    for (int i = n / 2; i < n; i++) {
      if (!vis[i] && !vis[j] && kzoo[i] / kzoo[j] >= 2) {
        vis[i] = 1;
        vis[j] = 1;
        j++;
        ans--;
      }
    }
    cout << ans << endl;
  }
  return 0;
}
