#include <bits/stdc++.h>
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
using namespace std;
const long long inf = numeric_limits<long long>::max() / 2;
const long double eps = 1e-9;
const long double pi = acosl(-1);
template <typename T>
inline bool mineq(T& a, T b) {
  return (a > b) ? (a = b, 1) : 0;
}
template <typename T>
inline bool maxeq(T& a, T b) {
  return (a < b) ? (a = b, 1) : 0;
}
void solve(), read();
signed main() {
  ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  ;
  read();
  solve();
  return 0;
}
long long n;
multiset<long long> q;
vector<long long> a;
void solve() {
  long long ans = 0;
  for (long long i = 0; i < n / 2; i++) {
    long long x = a[i];
    long long y = 2 * a[i];
    auto it = q.lower_bound(y);
    if (it != q.end()) {
      q.erase(it);
    }
    ++ans;
  }
  ans += (long long)((q).size());
  cout << ans;
}
void read() {
  cin >> n;
  a.resize(n);
  for (long long i = 0; i < n; i++) {
    cin >> a[i];
  }
  sort((a).begin(), (a).end());
  for (long long i = n / 2; i < n; i++) {
    q.insert(a[i]);
  }
  a.resize(n / 2);
}
