#include <bits/stdc++.h>
using namespace std;
const long long inf = 1e9 + 5;
const long long INF = 1e18 + 5;
const long long maxn = 5e5 + 5;
const int N = 3000 + 23;
int n;
int a[555555];
bool ok[555555];
int main() {
  cin >> n;
  for (int i = 1; i <= n; i++) cin >> a[i];
  int cnt = 0;
  sort(a + 1, a + n + 1);
  reverse(a + 1, a + n + 1);
  int l = n / 2 + 1;
  for (int i = 1; i <= n; i++) {
    int r = n;
    if (ok[i] == 0) {
      ok[i] = 1;
      while (l <= r) {
        int md = (l + r) >> 1;
        if (a[i] >= a[md] * 2 && ok[md] == 0)
          r = md - 1;
        else
          l = md + 1;
      }
      if (r + 1 <= n && a[i] >= a[r + 1] * 2 && ok[r + 1] == 0)
        cnt++, ok[r + 1] = 1;
      else
        cnt++;
    }
    l = max(l, i + 1);
  }
  cout << cnt;
  return 0;
}
