There are n kangaroos with pockets. Each kangaroo has a size (integer number). A kangaroo can go into another kangaroo's pocket if and only if the size of kangaroo who hold the kangaroo is at least twice as large as the size of kangaroo who is held.

Each kangaroo can hold at most one kangaroo, and the kangaroo who is held by another kangaroo cannot hold any kangaroos.

The kangaroo who is held by another kangaroo cannot be visible from outside. Please, find a plan of holding kangaroos with the minimal number of kangaroos who is visible.

Input

The first line contains a single integer — n (1 ≤ n ≤ 5·105). Each of the next n lines contains an integer si — the size of the i-th kangaroo (1 ≤ si ≤ 105).

Output

Output a single integer — the optimal number of visible kangaroos.

Examples

Input

8
2
5
7
6
9
8
4
2


Output

5


Input

8
9
1
6
2
6
5
8
3


Output

5



import java.io.*;
import java.util.*;
import java.util.Map.Entry;
import java.math.*;

import static java.lang.Math.*;
import static java.lang.Integer.*;
import static java.lang.Long.*;




public class WAC219 {
	int INF = Integer.MAX_VALUE / 100;
	static Scanner sc = null;
	static BufferedReader br = null;
	static PrintStream out = null;
	static BufferedWriter bw = null;
	int N = 0;
	
	public void solve() throws Exception{
		N = nextInt();
		int[] d = new int[N];
		for(int i = 0; i < N; i++){
			d[i] = nextInt();
		}
		Arrays.sort(d);
		int l = (N+1) / 2;
		int r = N;
		boolean f = true;
		for(int i = 0; i < N/2; i++){
			if(d[i] * 2 > d[i+l]){
				f = false;
			}
		}
		if(f){
			int ans = N - N/2;
			out.println(ans);
			return ;
		}
		
		while(l + 1 < r){
			int mid = (l + r ) / 2;
			boolean flag = true;
			for(int i = 0; i + mid < N; i++){
				if(d[i] * 2 > d[mid + i]){
					flag = false;
					break;
				}
			}
			if(flag){
				r = mid;
			}
			else{
				l = mid;
			}
		}
		
	
		int ans =N - ( N - r);
		
		
		out.println(ans);
		
	}
	
	void remove(TreeMap<Integer, Integer> map, Integer d){
		int cnt = map.get(d);
		if(cnt == 1){
			map.remove(d);
		}
		else{
			map.put(d, cnt-1);
		}
	}

    public int[] readIntArray(int n) {
        int[] ret = new int[n];
        for (int i = 0; i < n; i++) {
            ret[i] = sc.nextInt();
        }
        return ret;
    }
    
    private String nextS() throws IOException{
		String s = br.readLine();
		return s;
	}

	private int nextInt() throws IOException{
		String s = br.readLine();
		return parseInt(s);
	}
	
	private long nextLong() throws IOException{
		String s = br.readLine();
		return parseLong(s);
	}
	
	private int[] nextInts() throws IOException{
		String s = br.readLine();
		String[] sp = s.split(" ");
		int[] r = new int[sp.length];
		for(int i = 0;i < sp.length; i++){
			r[i] = parseInt(sp[i]);
		}
		return r;
	}
    
	/**
	 * @param args
	 */
	public static void main(String[] args) throws Exception{
		File file = new File("input.txt");
		if(file.exists()){
			System.setIn(new BufferedInputStream(new FileInputStream("input.txt")));
		}
		out = System.out;
		bw = new BufferedWriter(new PrintWriter(out));
		//sc =  new Scanner(System.in);
		br = new BufferedReader(new InputStreamReader(System.in));
		WAC219 t = new WAC219();
		t.solve();
		bw.close();
	}

}
