#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using vb = vector<bool>;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
int n;
vi s;
bool ok(int pos) {
  int i = 0, j = pos + 1;
  while (i <= pos && j < n) {
    if (s[j] >= 2 * s[i])
      i++, j++;
    else
      j++;
  }
  return i > pos;
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  cin >> n;
  s = vi(n);
  for (int i = 0; i < (int)n; i++) cin >> s[i];
  sort(s.begin(), s.end());
  int begin = 0, end = n - 1, mid = n, last_pos = -1;
  while (begin <= end) {
    mid = begin + (end - begin) / 2;
    if (ok(mid)) {
      last_pos = mid;
      begin = mid + 1;
    } else {
      end = mid - 1;
    }
  }
  if (last_pos == -1)
    cout << n << endl;
  else
    cout << n - (last_pos + 1) << endl;
}
