#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
const int N = 5e5 + 5;
int main() {
  int n;
  scanf("%d", &n);
  ;
  long long int a[n + 1];
  for (int i = 1; i <= n; i++) scanf("%lld", &a[i]);
  ;
  sort(a + 1, a + n + 1);
  int b[n + 1];
  for (int i = 1; i <= n; i++) {
    b[i] = 0;
  }
  if (n == 2) {
    if (2 * a[1] <= a[2]) {
      cout << 1 << endl;
    } else
      cout << 2 << endl;
    return 0;
  }
  for (int i = (n + 1) / 2, j = n; i > 0 && j > 0;) {
    while (b[i] && i > 0) i--;
    while (b[j] && j > 0) j--;
    if ((2 * a[i] <= a[j]) && (!b[i] && !b[j]) && (j > i)) {
      b[i] = 1;
      b[j] = 1;
      i--;
      j--;
      while (b[j] && j > 0 && j > i) {
        j--;
      }
    } else if ((2 * a[i] > a[j]) && (!b[i] && !b[j])) {
      i--;
    }
  }
  int cnt1 = 0;
  for (int i = 1; i <= n; i++) {
    if (b[i] == 1) cnt1++;
  }
  printf("%d\n", n - cnt1 / 2);
  ;
  return 0;
}
