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
/* package codechef; // don't place package name! */

import java.util.*;
import java.lang.*;
import java.io.*;

/* Name of the class has to be "Main" only if the class is public. */
class Main
{
    public static void main (String[] args) throws java.lang.Exception
    {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        StringTokenizer st = new StringTokenizer(br.readLine());

        int N = Integer.parseInt(st.nextToken());
        st = new StringTokenizer(br.readLine());
        int[] arr = new int[N];
        int max = -1;
        for (int i=0; i<N; i++){
            arr[i] = Integer.parseInt(st.nextToken());
            max = Math.max(max, arr[i]);
        }

        Arrays.sort(arr);

        boolean[] dp = new boolean[max+1];
        int[] count = new int[max+1];
        //dups
        for (int i=0; i<N; i++){
            count[arr[i]]++;
        }
        //sieve
        for (int i=0; i<N; i++){
            if (!dp[arr[i]]){
                for (int j=2; j*arr[i]<=max; j++){
                    dp[j*arr[i]]=true;
                }
            }
        }

        int ans=0;
        for (int i=0; i<N; i++){
            if (!dp[arr[i]]&&count[arr[i]]==1)
                ans++;
        }

        System.out.println(ans);


    }




}

