#include <bits/stdc++.h>
using namespace std;
template <typename S, typename T>
ostream &operator<<(ostream &os, pair<S, T> &m) {
  os << '[' << m.first << " " << m.second << ']';
  return os;
}
int n;
vector<int> v;
bool func(int k) {
  int x = k - 1, y = n - 1;
  for (int i = x; i >= 0; --i) {
    if (2 * v[x] > v[y]) return false;
    x--, y--;
  }
  return true;
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0), cout.tie(0);
  cin >> n;
  v.resize(n);
  for (int i = 0; i < n; ++i) cin >> v[i];
  sort(begin(v), end(v));
  int lo = 0, hi = n / 2, ans = 0;
  while (lo <= hi) {
    int mid = (lo + hi) / 2;
    if (func(mid)) {
      ans = mid;
      lo = mid + 1;
    } else
      hi = mid - 1;
  }
  cout << n - ans << endl;
  return 0;
}
