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.BufferedReader;
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.OutputStream;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.io.Writer;
import java.math.BigDecimal;
import java.math.BigInteger;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.StringTokenizer;
 
public class TaskC{

    public static void main(String[] args){
    	InputStream inputStream = System.in;
    	OutputStream outputStream = System.out;
    	
    	InputReader in = new InputReader(inputStream);
    	OutputWriter out = new OutputWriter(outputStream);
    	
    	n = in.nextInt();
    	a = in.nextIntArray(n);
    	Arrays.sort(a);
    	
    	int l=0,r=n/2;
    	while(l<r){
    		int mid = (l+r+1)>>1;
    		if(check(mid)) l=mid; else r=mid-1;
    	}
    	
    	
    	out.write(n-l);
    	out.flush();
    	out.close();
    }
    
    static int[] a;
    static int n;
    static boolean check(int size){
    	boolean flag=true;
    	for(int i=0; i<size; i++){
    		flag&=a[i]*2<=a[n-size+i];
    	}
    	return flag;
    }
    
}


 

class InputReader{
	
	private BufferedReader reader;
	private StringTokenizer tokenizer;
	
	public InputReader(InputStream stream){
		reader = new BufferedReader(new InputStreamReader(stream));
		tokenizer = null;
	}
	
	public String next(){
		while(tokenizer == null || !tokenizer.hasMoreTokens()){
			try{
				tokenizer = new StringTokenizer(reader.readLine());
			}catch(IOException e){
				throw new RuntimeException(e);
			}
		}
		
		return tokenizer.nextToken();
	}
	
	public String nextLine(){
		tokenizer = null;
		try{
			return reader.readLine();
		}catch(IOException e){
			throw new RuntimeException(e);
		}
		
}
	
	public int nextInt(){
		return Integer.parseInt(next());
	}
	
	public long nextLong(){
		return Long.parseLong(next());
	}
	
	public double nextDouble(){
		return Double.parseDouble(next());
	}
	
	public BigInteger nextBigInteger(){
		return new BigInteger(next());
	}
	
	public BigDecimal nextBigDecimal(){
		return new BigDecimal(next());
	}
	
	public int[] nextIntArray(int n){
		int[] rez = new int[n];
		for(int i=0; i<n; ++i)
			rez[i] = nextInt();
		
		return rez;
	
	}
}

        
class OutputWriter{
	private PrintWriter out;
	
	public OutputWriter(Writer out){
		this.out = new PrintWriter(out);
	}
	
	public OutputWriter(OutputStream out){
		this.out = new PrintWriter (new BufferedWriter(new OutputStreamWriter(out)));
	}
	
	public void write(Object ... o){
		for(Object x : o) out.print(x);
	}	
	
	public void writeln(Object ... o){
		write(o);
		out.println();
	}
	
	public void flush(){
		out.flush();
	}
	
	public void close(){
		out.close();
	}

}
        

       
        

       

