#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f;
const long long int LINF = 0x3f3f3f3f3f3f3f3fll;
const int MOD = 1e9 + 7;
const long double pi = acos(-1);
int n;
int main() {
  ios::sync_with_stdio(false);
  cin >> n;
  vector<int> arr(n), state(n, 0);
  for (auto &it : arr) cin >> it;
  sort(arr.begin(), arr.end(), greater<int>());
  int p0 = 0, p1 = n / 2;
  while (p0 != n && p1 != n) {
    if (state[p0])
      p0++;
    else if (state[p1])
      p1++;
    else if (p1 <= p0)
      p1++;
    else if (2 * arr[p1] <= arr[p0]) {
      state[p0++] = 1;
      state[p1++] = 2;
    } else
      p1++;
  }
  int amnt = 0;
  for (auto it : state)
    if (it != 2) amnt++;
  cout << amnt << endl;
  return 0;
}
