#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, num;
  int v[500000 + 5];
  int v1[500000 + 5];
  int v2[500000 + 5];
  scanf("%d", &n);
  int t = n;
  int index = 0;
  while (t--) {
    scanf("%d", &num);
    v[index++] = num;
  }
  sort(v, v + n);
  for (int i = 0; i < n / 2; ++i) v1[i] = v[i];
  index = n / 2;
  for (int i = 0; i < (n - n / 2); ++i) v2[i] = v[index++];
  int count = 0;
  int in = 0;
  if (n % 2 == 0) {
    int j = n / 2 - 1;
    for (int i = n / 2 - 1; i >= 0; --i) {
      while (j >= 0) {
        if (v1[j] * 2 <= v2[i]) {
          ++count;
          --j;
          break;
        } else
          --j;
      }
      if (j < 0) break;
    }
  } else {
    int j = n / 2 - 1;
    for (int i = n / 2; i >= 1; --i) {
      while (j >= 0) {
        if (v1[j] * 2 <= v2[i]) {
          ++count;
          --j;
          break;
        } else
          --j;
      }
      if (j < 0) break;
    }
  }
  cout << n - count << endl;
}
