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.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.Comparator;

public class Main {
	public static void main(String[] args) throws IOException {
		BufferedReader r = new BufferedReader(new InputStreamReader(System.in), 1);
		String s;
		String sl[];

		s = r.readLine();
		sl = s.split(" ");

		int n = Integer.parseInt(sl[0]);

		s = r.readLine();
		sl = s.split(" ");
		int a[] = new int[n];
		boolean b[] = new boolean[1000001];

		for (int i = 0; i < n; i++) {
			a[i] = Integer.parseInt(sl[i]);
		}

		Arrays.sort(a);

		int pre = -1;

		for (int i = 0; i < n; i++) {
			if(b[a[i]])
			{
				continue;
			}
			if(pre == a[i])
			{
				pre = a[i];
				b[a[i]] = true;
				continue;
			}
			pre = a[i];
			for(int j = a[i] * 2; j <= 1000000; j += a[i])
			{
				b[j] = true;
			}
		}

		int v = 0;
		for(int i = 0; i < n; i++)
		{
			if(!b[a[i]]) v++;
		}

		System.out.println(v);
	}
}