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 StringTokenizer st;
    static BufferedReader br;  
    static PrintWriter out;
 
    static int parent[]; 

    public static void main(String[] args) throws IOException {
        br = new BufferedReader(new InputStreamReader(System.in));
 
        int N = nextInt();
        
        int[] A = new int[N];

        for (int x=0; x<N; x++) {
            A[x] = nextInt();
        }

        Arrays.sort(A);

        int[] cnt = new int[A[N-1]+1];
        boolean[] dp = new boolean[A[N-1]+1];
        Arrays.fill(dp, true); //true mean not contain

        for (int x=0; x<N; x++) {
            cnt[A[x]] ++;
            if( cnt[A[x]] >1 ){
                dp[A[x]] = false;
            }
        }
 
    
        //Sieve of Eratosthenes
        for (int x=0; x<N; x++) {
            int curr = A[x];
            if(dp[curr] || cnt[curr]>1) {
                for (int z = 2; z *curr <=A[N-1]; z++) 
                {
                    dp[z * curr] = false;
                }
            }
        }

        int ans = 0;
        for (int x=0; x<N; x++) {
            if(dp[A[x]]==false){
                ans ++;
            }
        }

        System.out.println(N-ans);
        
    
    }
 
    public static int nextInt() throws IOException {
        return Integer.parseInt(next());
    }
    public static long nextLong() throws IOException {
        return Long.parseLong(next());
    }

    public static double nextDouble() throws IOException {
        return Double.parseDouble(next());
    }

    static String next() throws IOException {
        while (st == null || !st.hasMoreTokens())
            st = new StringTokenizer(br.readLine().trim());
        return st.nextToken();
    }
}