#include <bits/stdc++.h>
using namespace std;
vector<string> split(string s) {
  istringstream buf(s);
  istream_iterator<string> beg(buf), end;
  vector<string> list(beg, end);
  return list;
}
void solve() {
  int n, ans;
  cin >> n;
  ans = n;
  vector<int> v(n);
  for (int i = 0; i < n; i++) cin >> v[i];
  sort(v.begin(), v.end());
  int mid_key = v[n - 1] / 2;
  int mid = upper_bound(v.begin(), v.end(), mid_key) - v.begin() - 1;
  int stop = min(mid, n / 2 - 1), j = n - 1, i = stop;
  while (i >= 0 && j > stop) {
    if (v[j] - v[i] >= v[i]) {
      j--;
      ans--;
    }
    i--;
  }
  cout << ans;
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  int t = 1;
  for (int test_case = 1; test_case <= t; test_case++) solve();
  return 0;
}
