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.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.util.*;

public class Main {
    public static void main(String[] args) throws Exception {
        Main main = new Main();
        main.solve();
    }

    public void solve() throws Exception {
        Scanner scan = new Scanner(new BufferedReader(new InputStreamReader(System.in)));
        int N = scan.nextInt();
        int[] A = new int[N];
        for (int i = 0; i < N; i++) {
            A[i] = scan.nextInt();
        }
        Arrays.sort(A);
        int max = A[N-1];
        boolean[] dp = new boolean[max+1];
        Arrays.fill(dp, true);
        for (int i = 0; i < N; i++) {
            if (dp[A[i]] == false) {
                continue;
            }
            for (int j = 2; A[i] * j <= max; j++) {
                dp[A[i]*j] = false;
            }
        }
        for (int i = 1; i < N; i++) {
            if (A[i-1] == A[i]) {
                dp[A[i]] = false;
            }
        }
        int a = 0;
        for (int i = 0; i < N; i++) {
            if (dp[A[i]]) {
                a += 1;
            }
        }
        System.out.println(a);
    }
}
