#include <bits/stdc++.h>
using namespace std;
void solve() {
  long long int n, i, j, mid, count = 0;
  cin >> n;
  mid = n / 2 - 1;
  vector<long long int> arr(n);
  for (i = 0; i < n; i += 1) cin >> arr[i];
  sort(arr.begin(), arr.end());
  j = mid + 1;
  for (i = 0; i <= mid; i += 1) {
    while (j < n and arr[i] * 2 > arr[j]) {
      count += 1;
      j += 1;
    }
    if (j == n) break;
    count += 1;
    j += 1;
  }
  count += (mid + 1 - i);
  count += (n - j);
  cout << count << endl;
}
int main() { solve(); }
