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
{
    public static void main(String args[])throws Exception
    {
        BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
        PrintWriter pw=new PrintWriter(System.out);
        int n=Integer.parseInt(br.readLine());
        int cnt[]=new int[1000001];
        HashSet<Integer> hs=new HashSet<>();
        String str[]=br.readLine().split(" ");
        int arr[]=new int[n];
        for(int i=0;i<n;i++)
        {
            arr[i]=Integer.parseInt(str[i]);
            cnt[arr[i]]+=1;
            hs.add(arr[i]);
        }
        if(cnt[1]==1)
        pw.println(1);
        else if(cnt[1]>1)
        pw.println(0);
        else
        {
            int ans=0;
            for(int i:hs)
            {
                if(cnt[i]==1)
                {
                    boolean got=true;
                    for(int j=2;j<=1000;j++)
                    {
                        if(i%j==0)
                        {
                            if(j!=i&&(cnt[j]>0||cnt[i/j]>0))
                            {
                                got=false;
                                break;
                            }
                        }
                    }
                    if(got)
                    ans++;
                }
            }
            pw.println(ans);
        }
        pw.flush();
        pw.close();
    }
}