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.*;
import java.util.stream.Collectors;
import java.io.*;
import java.nio.charset.StandardCharsets;

public class Main {
	public static void main(String[] args) throws IOException {
		InputStreamReader reader = new InputStreamReader(System.in, StandardCharsets.UTF_8);
		BufferedReader in = new BufferedReader(reader);
		Main ins = new Main(in);
		ins.calc();
		ins.showResult();
	}

	int N;
	int[] A;
	boolean[] flags;
	int AMAX = 1000001;
	Deque<Integer> uncheck;

	Main(BufferedReader in) throws IOException {
		N = Integer.parseInt(in.readLine());
		String[] tokens = in.readLine().split(" ");
		A = new int[N];
		for (int i = 0; i < N; ++i) {
			A[i] = Integer.parseInt(tokens[i]);
		}
		Arrays.sort(A);
		flags = new boolean[AMAX + 1];
		Arrays.fill(flags, true);
		uncheck = new ArrayDeque<>();
		for (int i = 0; i < N; ++i) {
			uncheck.add(i);
		}
	}

	void check(int[] array, int target) {
		Deque<Integer> temp = new ArrayDeque<>();
		if (target + 1 < N && array[target] == array[target + 1]) {
			flags[target] = false;
		}
		uncheck.poll();
		while (!uncheck.isEmpty()) {
			int i = uncheck.poll();
			if (array[i] % array[target] == 0) {
				flags[i] = false;
			} else {
				temp.add(i);
			}
		}
		uncheck = temp;
	}

	void calc() {
		int count = 0;
		while (!uncheck.isEmpty()) {
			int target = uncheck.poll();
			if (!flags[A[target]]) {
				continue;
			} else if (target + 1 < N && A[target] == A[target + 1]) {
				flags[A[target]] = false;
			} else {
				++count;
				flags[A[target]] = false;
			}
			for (int val = A[target] * 2; val <= AMAX; val += A[target]) {
				flags[val] = false;
			}
		}
		System.out.println(count);
	}

	void showResult() {
	}
}