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.io.*;
public class Main{
	static int[] a;
	static ArrayList<Integer> x = new ArrayList<Integer>();
   public static void main(String[] main) throws Exception{
      BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
      StringTokenizer st = new StringTokenizer(br.readLine());
      PrintWriter out = new PrintWriter(System.out);
      int n = Integer.parseInt(st.nextToken());
      st = new StringTokenizer(br.readLine());
      a = new int[n];
      for(int i = 0; i < n; i++)
          a[i] = Integer.parseInt(st.nextToken());
      Arrays.sort(a);
      sieve();
      out.println(x.size());
      out.close();
   }
   static void sieve() {
	   boolean[] dp = new boolean[1000001];
	   for(int i = 0; i < dp.length; i++)
		   dp[i] = true;
	   HashSet<Integer> elements = new HashSet<Integer>();
	   HashSet<Integer> dup = new HashSet<Integer>();
	   for(int i = 0; i < a.length; i++) {
		   if(elements.contains(a[i]))
			   dup.add(a[i]);
		   elements.add(a[i]);
		   if(!dup.contains(a[i]) && dp[a[i]] && a[i] <= 500000) {
			   for(int j = a[i]*2; j < 1000001; j += a[i]) {
				   dp[j] = false;
			   }
		   }
	   }
	   for(int i = 0; i < a.length; i++)
		   if(dp[a[i]] && !dup.contains(a[i]))
			   x.add(a[i]);
   }
}