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.Arrays;
import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;

public class Main {

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int N = sc.nextInt();
		int A[] = new int[N];
		int count =0;
		Set<Integer> set = new HashSet<Integer>();
		Set<Integer> repeat = new HashSet<Integer>();
		for (int i=0;i<N;i++) {
			A[i] = sc.nextInt();
			if (set.contains(A[i])) {
				repeat.add(A[i]);
			}
			set.add(A[i]);
		}
		Arrays.sort(A);
		for (int i=0;i<N;i++) {
			if (repeat.contains(A[i])) {
				continue;
			}
			boolean b = false;
			if (A[i]!=1) {
				if (set.contains(1)==true) {
					continue;
				}
			}
			for (int j=2;j*j<=A[i];j++) {
				if (A[i]%j==0) {
					if (set.contains(A[i]/j)||set.contains(j)) {
						b = true;
						break;
					}
				}
			}
			if (b==false) {
				count++;
			}
		}
		System.out.println(count);
	}
}