#include <bits/stdc++.h>
using namespace std;
const long long maxn = 5e5 + 10;
long long N, arr[maxn], use[maxn];
signed main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cin >> N;
  for (register long long i = 1; i <= N; ++i) {
    cin >> arr[i];
  }
  sort(arr + 1, arr + 1 + N);
  long long pos = N / 2, l = pos + 1, r = N, ans = N;
  while (pos >= 1) {
    if (l <= r && arr[pos] * 2 <= arr[r]) {
      --ans, --r;
    }
    pos--;
  }
  cout << ans << endl;
  return 0;
}
