#include <bits/stdc++.h>
using namespace std;
int a[600010];
struct node {
  int val;
  node(){};
  node(int v) { val = v; }
  bool operator<(const node &s) const { return val < s.val; }
};
priority_queue<node> ss;
int cmp(int a, int b) { return a > b; }
int main() {
  int i, n, m, k;
  int ans;
  node dd;
  while (scanf("%d", &n) != EOF) {
    ans = 0;
    while (!ss.empty()) ss.pop();
    for (i = 1; i <= n; i++) {
      scanf("%d", &a[i]);
    }
    sort(a + 1, a + 1 + n);
    for (i = n / 2 + 1; i <= n; i++) ss.push(node(a[i]));
    for (i = n / 2; i >= 1; i--) {
      dd = ss.top();
      if (dd.val >= a[i] * 2) {
        ss.pop();
        ans++;
      }
    }
    cout << n - ans << endl;
  }
  return 0;
}
