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.*;
import java.util.*;

public class Main {
    static PrintWriter out = new PrintWriter(System.out);
    static Scanner sc = new Scanner(System.in);
    static BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
    long mod = 998244353;
    public static void main(String[] args) throws IOException {
        Main main = new Main();

        main.solve();
//        long ans = main.solve();

        out.flush();
    }
    void solve() throws IOException {
        int n = sc.nextInt();
        int[] a = new int[n];
        for(int i=0; i<n; i++) a[i] = sc.nextInt();
        Arrays.sort(a);
        int  maxn = a[n-1];
        boolean[] rec = new boolean[maxn+1];
        int ans = 0, idx = 0;
        while(idx<n){
            int r = idx, num = a[idx];
            while(r<n&&a[r]==num) r++;
            if(!rec[num]&&r-idx==1) ans++;
            if(!rec[num]){
                for(int j=num; j<=maxn; j+= num){
                    rec[j] = true;
                }
            }
            idx = r;
        }
        out.println(ans);
    }

    int paIn(String s){return Integer.parseInt(s);}
}