#include <bits/stdc++.h>
using namespace std;
template <typename X>
ostream& operator<<(ostream& x, const vector<X>& v) {
  for (long long i = 0; i < v.size(); ++i) x << v[i] << " ";
  return x;
}
template <typename X>
ostream& operator<<(ostream& x, const set<X>& v) {
  for (auto it : v) x << it << " ";
  return x;
}
template <typename X, typename Y>
ostream& operator<<(ostream& x, const pair<X, Y>& v) {
  x << v.ff << " " << v.ss;
  return x;
}
template <typename T, typename S>
ostream& operator<<(ostream& os, const map<T, S>& v) {
  for (auto it : v) os << it.first << "=>" << it.second << endl;
  return os;
}
struct pair_hash {
  inline std::size_t operator()(
      const std::pair<long long, long long>& v) const {
    return v.first * 31 + v.second;
  }
};
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC targett("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
const int N = 5 * 100005;
;
long long a[N];
int n;
bool chk(long long x) {
  int i = 0;
  int j = n - x;
  int k = 0;
  while (k < x) {
    if (a[i] * 2 > a[j]) {
      return false;
    }
    i++;
    j++;
    k++;
  }
  return true;
}
long long bs10(long long lo, long long hi) {
  if (!chk(lo)) {
    return 0;
  }
  if (chk(hi)) {
    return hi;
  }
  while (lo < hi) {
    long long mid = (lo + hi) / 2;
    if (chk(mid)) {
      lo = mid + 1;
      if (!chk(lo)) {
        return mid;
      }
    } else {
      hi = mid - 1;
    }
  }
  return lo;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cin >> n;
  for (long long i = 0; i < n; i++) {
    cin >> a[i];
  };
  sort(a, a + n);
  cout << (n - bs10(1, n / 2));
}
