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

public class Main {

	static Main instance = new Main();

	public static void main(String[] args) {

		Scanner scan = new Scanner(System.in);

		Set<Integer> set = new HashSet<>();

		//入力値取得
		int N = scan.nextInt();

		Set<Integer> AList = new TreeSet<>();
		Set<Integer> dpl = new HashSet<>();

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

			if (dpl.contains(A)) {
				set.add(A);
			} else {
				dpl.add(A);
				AList.add(A);
			}
		}

		//WK変数
		Set<Integer> ald = new HashSet<>();

		for (int A : AList) {
			if (!ald.contains(A)) {
				for (int j = 2; j * A <= 1000000; j++) {
					set.add(j * A);
					ald.add(j * A);
				}
			}
		}

		//演算
		int result = 0;

		for (int A : AList) {
			if (!set.contains(A)) {
				result++;
			}
		}

		//結果出力
		System.out.println(result);
	}
}