1
1
 12
55
75
1
98
63
64
9
39
82
18
47
9
 7
1
2
4
8
16
32
64
 4
1
1
1
2
 5
1
2
4
8
16
 100
678
771
96
282
135
749
168
668
17
658
979
446
998
331
606
756
37
515
538
205
647
547
904
842
647
286
774
414
267
791
595
465
8
327
855
174
339
946
184
250
807
422
679
980
64
530
312
351
676
911
803
991
669
50
293
841
545
598
737
894
231
754
588
83
873
767
833
482
905
903
970
571
715
59
777
697
537
861
339
212
149
889
905
70
970
307
830
465
968
291
430
317
942
944
330
235
814
880
415
76
 12
3
99
24
46
75
63
57
55
10
62
34
52
 3
1
2
4
 100
154
60
97
638
139
150
570
579
601
647
804
237
245
549
288
347
778
282
916
441
974
145
957
886
655
702
930
618
132
520
972
48
94
54
682
433
896
134
845
636
242
842
125
141
240
130
409
666
948
938
604
110
474
484
364
40
807
271
438
288
201
814
754
589
341
576
146
952
819
923
222
535
336
83
314
911
303
911
384
601
249
330
735
271
142
204
405
783
775
449
590
139
109
276
45
205
454
836
82
841

1
 6
 4
 3
 3
 58
 7
 2
 50

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.StringTokenizer;

public class Solution {

//	public static final double EPS = 1e-9;
//	public static final int MOD = 1000000007;
//	public static final double PI = 3.1415926535897932384626433832795028841971693993751058209749445923078164062862089986280348253421170679;
//	public static final int DX[] = {1, -1, 0, 0};
//	public static final int DY[] = {0, 0, 1, -1};
//	public final int sievesize = (int) (1e6);
//	public boolean[] prime;

	public static void main(String[] args) throws IOException {
		InputStream inputStream = System.in;
		OutputStream outputStream = System.out;
		InputReader in = new InputReader(inputStream);
		OutputWriter out = new OutputWriter(outputStream);
		Task solver = new Task();
		solver.solve(1, in, out);
		out.close();
	}

	static class Task {
		
		public void solve(int testNumber, InputReader in, OutputWriter out) throws IOException {
			int n = in.nextInt();
			int[] arr = in.nextIntArray(n);
			Arrays.sort(arr);
			long cnt = 0;
			int mid = n / 2;
			for (int i = mid - 1, j = n - 1; i >= 0; i--) {
				if (arr[i] * 2 <= arr[j]) {
					cnt++;
					arr[i] = arr[j] = -1;
					j--;
				}
			}
			for (int i = 0; i < n; i++)
				if (arr[i] != -1) cnt++;
			out.println(cnt, "\n");
		}

//		static class Node {
//			String name;
//			LinkedList<Node> list;
//			
//			public Node(String name) {
//				this.name = name;
//				list = new LinkedList<>();
//			}
//		}
        
//		static class Pair<T1, T2> {   	
//	      	T1 first;
//	      	T2 second;
//		        	
//		    public Pair(T1 first, T2 second) {
//	    		this.first = first;
//				this.second = second;
//			}
//	    }
		
	}
	
//	public static void sieve(){
//		prime = new boolean[sievesize + 1];
//		Arrays.fill(prime, true);
//	    for(int x = 2; x * x < sievesize; x++)
//	    { 
//	    	if(prime[x])
//	    		for(int y = x * 2; y < sievesize; y += x) 
//	    			prime[y] = false; 
//	    }
//	}

//	public static int[] shuffle(int arr[], Random gen) {
//		for (int i = arr.length - 1; i > 0; i--) {
//            int index = gen.nextInt(i + 1);
//            int temp = arr[index];
//            arr[index] = arr[i];
//            arr[i] = temp;
//        }
//		return arr;
//	}
	
//	public static boolean triangle(long a, long b, long c){
//	    return ((a+b) > c && (b+c) >a && (a+c) > b);
//	}
	
//	public static boolean isPerfectSquare(long n){
//		if (n < 0) 
//	    	return false;
//	    long test = (long) (Math.sqrt(n) + 0.5);
//	    return test*test == n;
//	}
	
//	public static int isnum(char s){
//		if(s=='1' || s=='2' || s=='3' || s=='4' || s=='5' || s=='6' || s=='7' || s=='8' || s=='9' || s=='0') 
//	    	return 1; 
//		return 0;
//	}
	
//	public static long nextPowerOf2(long n){
//	    n--;
//	    n |= n >> 1;
//	    n |= n >> 2;
//	    n |= n >> 4;
//	    n |= n >> 8;
//	    n |= n >> 16;
//	    n++;
//	    return n;
//	}
	
//	public static int gcd(int a, int b){
//	    int t; 
//	    while (b > 0){ 
//	    	a = a % b; 
//	    	t = a; 
//	    	a = b; 
//	    	b = t; 
//    	}
//	    return a;
//	}
	
//	public static int findGcdArray(int[] arr) {
//		int min = Integer.MAX_VALUE;
//		for (int i = 0; i < arr.length; i++)
//			min = Math.min(min, arr[i]);
//		while (min > 1) {
//			int i = 0, s = 0;
//			while (i < arr.length) {
//				s += arr[i] % min;
//				i++;
//			}
//			if (s == 0) return min;
//			min--;
//		}
//		return 1;
//	}

	static class InputReader {
		public BufferedReader reader;
		public StringTokenizer tokenizer;

		public InputReader(InputStream stream) {
			reader = new BufferedReader(new InputStreamReader(stream), 32768);
			tokenizer = null;
		}
		
		private void tokenize() {
			while (tokenizer == null || !tokenizer.hasMoreTokens()) {
				try {
					tokenizer = new StringTokenizer(reader.readLine());
				} catch (IOException e) {
					throw new RuntimeException(e);
				}
			}
		}

		public String next() {
			tokenize();
			return tokenizer.nextToken();
		}

		public int nextInt() {
			return Integer.parseInt(next());
		}

		public long nextLong() {
			return Long.parseLong(next());
		}
		
		public char nextChar() {
			return next().charAt(0);
		}
		
		public float nextFloat() {
			return Float.parseFloat(next());
		}
		
		public double nextDouble() {
			return Double.parseDouble(next());
		}

		public int[] nextIntArray(int size) {
			tokenize();
			int[] arr=new int[size];
			for(int i = 0; i < size; i++) {
				tokenize();
				arr[i] = Integer.parseInt(tokenizer.nextToken());
			}
			return arr;
		}
		
		public long[] nextLongArray(int size) {
			tokenize();
			long[] arr=new long[size];
			for(int i = 0; i < size; i++) {
				tokenize();
				arr[i] = Long.parseLong(tokenizer.nextToken());
			}
			return arr;
		}
		
		public float[] nextFloatArray(int size) {
			tokenize();
			float[] arr=new float[size];
			for(int i = 0; i < size; i++) {
				tokenize();
				arr[i] = Float.parseFloat(tokenizer.nextToken());
			}
			return arr;
		}

		public double[] nextDoubleArray(int size) {
			tokenize();
			double[] arr=new double[size];
			for(int i = 0; i < size; i++) {
				tokenize();
				arr[i] = Double.parseDouble(tokenizer.nextToken());
			}
			return arr;
		}

		public String[] nextStringArray(int size) throws IOException {
			String[] arr=new String[size];
			for(int i = 0; i < size; i++) 
				arr[i] = reader.readLine();
			return arr;
		}

		public char[] nextCharArray(int size) throws IOException {
			return reader.readLine().toCharArray();
		}
	}

	static class OutputWriter {
		public PrintWriter pw;

		public OutputWriter(OutputStream stream) {
			pw = new PrintWriter(stream);
		}
		
		public void println(Object... obj) {
			if (obj.length == 0) pw.println();
			else {
				String delimiter = (String) obj[obj.length - 1];
				for (int i = 0 ; i < obj.length - 2; i++) {
					pw.print(obj[i]);
					pw.print(delimiter);
				}
				pw.println(obj[obj.length - 2]);
			}
		}

		public void close() {
			pw.close();
		}

		public void flush() {
			pw.flush();
		}

		public void printStringArray(String[] arr) {
			for(int i = 0; i < arr.length; i++)
				pw.println(arr[i]);
		}

		public void printIntArray(int[] arr) {
			for(int i = 0; i < arr.length; i++)
				pw.print(arr[i] + " ");
		}

		public void printLongArray(long[] arr) {
			for(int i = 0; i < arr.length; i++)
				pw.print(arr[i] + " ");
		}

		public void printCharArray(char[] arr) {
			for(int i = 0; i < arr.length; i++)
				pw.print(arr[i] + " ");
		}

		public void printFloatArray(float[] arr) {
			for(int i = 0; i < arr.length; i++)
				pw.print(arr[i] + " ");
		}

		public void printDoubleArray(double[] arr) {
			for(int i = 0; i < arr.length; i++)
				pw.print(arr[i] + " ");
		}
	}
}