#include <bits/stdc++.h>
#pragma GCC optimize("O3")
using namespace std;
int di[] = {0, 0, 1, -1, 1, 1, -1, -1};
int dj[] = {1, -1, 0, 0, -1, 1, 1, -1};
const int N = 5e5 + 5;
int n;
int arr[N];
bool valid(int sz) {
  int rem = n - sz, next = n - 1;
  bool ret = 1;
  for (int i = rem - 1; i >= 0; i--) ret &= arr[i] * 2 <= arr[next--];
  return ret;
}
int main() {
  scanf("%d", &n);
  for (int i = 0; i < n; i++) scanf("%d", arr + i);
  sort(arr, arr + n);
  int l = ceil(n / 2.0), r = n, ans;
  while (l <= r) {
    int mid = l + (r - l) / 2;
    if (valid(mid)) {
      ans = mid;
      r = mid - 1;
    } else
      l = mid + 1;
  }
  printf("%d", ans);
}
