#include <bits/stdc++.h>
using namespace std;
const int N = 5 * 1e5 + 10;
struct querry {
  long long f, s, t;
};
long long a[N];
long long mp[N];
std::set<pair<long long, long long> > s;
long long res[N];
long long visit[N];
long long cur;
long long dp[N];
querry q[N];
long long BIT[1 << 21];
long long BITT[1 << 21];
int main(int argc, char const *argv[]) {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long n, lt, rt, res = 0;
  cin >> n;
  for (int i = 0; i < n; ++i) {
    cin >> a[i];
  }
  rt = n - 1;
  lt = (n - 1) / 2;
  sort(a, a + n);
  while (lt > -1) {
    long long temp;
    if (a[lt] <= (long long)a[rt] / 2) {
      mp[lt] = 1;
      ++res;
      while (mp[--rt]) {
      }
    }
    lt = min(lt - 1, rt - 1);
  }
  cout << n - res;
  return 0;
}
