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.util.ArrayList;
import java.util.Map;
import java.util.Queue;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Collections;
import java.util.HashMap;
import java.util.LinkedList;
import java.util.Scanner;
import java.util.Stack;
import java.util.TreeMap;

public class Main {
	
	public static void main(String[] args) throws IOException {
		String[] input;
		PrintWriter out = new PrintWriter(System.out);
		BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
		Scanner s = new Scanner(System.in);
		int n = Integer.parseInt(reader.readLine());
		int[] arr = new int[1000001];
		input = reader.readLine().split(" ");
		for(int i = 0; i < n; i++) {
			arr[Integer.parseInt(input[i])]++;
		}
		boolean[] divisible = new boolean[1000001];
		int ans = 0;
		for(int i = 1; i < arr.length; i++) {
			if(arr[i] > 0 && !divisible[i]) {
				for(int j = i * 2; j < arr.length; j += i) {
					divisible[j] = true;
				}
				if(arr[i] > 1) {
					divisible[i] = true;
				}
			}
			if(!divisible[i]) {
				ans += arr[i];
			}
		}
		out.print(ans);
		out.flush();
		out.close();
	}

}
