#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
const ll MOD = 1000000007;
bool works(int mid, int n, vector<int> &v) {
  int p1 = 0, p2 = n - mid;
  while (mid--) {
    if (v[p2] < 2 * v[p1]) return false;
    p1++;
    p2++;
  }
  return true;
}
void solve() {
  int n;
  cin >> n;
  vector<int> v(n);
  for (int i = (0); i < (n); i++) cin >> v[i];
  sort(v.begin(), v.end());
  int l = 0, r = n / 2 + 1;
  while (r - l > 1) {
    int mid = (r + l) / 2;
    if (works(mid, n, v))
      l = mid;
    else
      r = mid;
  }
  cout << n - l << "\n";
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  cout.tie(nullptr);
  int t;
  t = 1;
  while (t--) solve();
  return 0;
}
