Given is a number sequence A of length N.

Find the number of integers i \left(1 \leq i \leq N\right) with the following property:

* For every integer j \left(1 \leq j \leq N\right) such that i \neq j , A_j does not divide A_i.

Constraints

* All values in input are integers.
* 1 \leq N \leq 2 \times 10^5
* 1 \leq A_i \leq 10^6

Input

Input is given from Standard Input in the following format:


N
A_1 A_2 \cdots A_N


Output

Print the answer.

Examples

Input

5
24 11 8 3 16


Output

3


Input

4
5 5 5 5


Output

0


Input

10
33 18 45 28 8 19 89 86 2 4


Output

5
import java.util.HashMap;
import java.util.Scanner;

public class Main {
        public static void main(String[] args) {
                Scanner scan = new Scanner(System.in);

                int N = scan.nextInt();

                int[] A = new int[N];
                HashMap<Integer, Integer> aHash = new HashMap<Integer, Integer>();
                HashMap<Integer, Integer> aKaburiHash = new HashMap<Integer, Integer>();

                for (int i = 0; i < N; i++) {
                	int temp = scan.nextInt();
                	A[i] = temp;

                	if (!aHash.containsKey(temp)) {
                		aHash.put(temp, 1);
                	} else {
                		aKaburiHash.put(temp, 1);
                	}

                }

                scan.close();

                int count = 0;

                aRoop: for (int a = 0; a < N; a++) {
                	
                	int tempA = A[a];

                	if (aKaburiHash.containsKey(tempA)) {
                		continue aRoop;
                	}
                	
                	aHash.remove(tempA);

	                int rootA = (int)Math.sqrt(tempA);

	                for (int i = 1; i <= rootA; i++) {


	                	if (tempA%i == 0) {

	                		if (aHash.containsKey(i)) {
	                			continue aRoop;
	                		}

	                		if (i != tempA/i && aHash.containsKey(tempA/i)) {
	                			continue aRoop;
	                		}
	                		
	                	}

	                }
	                
	                count++;
	                
	                aHash.put(tempA, 1);

                }

                System.out.println(count);

        }
}