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.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Scanner;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        ABC170_d1 solver = new ABC170_d1();
        solver.solve(1, in, out);
        out.close();
    }

    static class ABC170_d1 {
        public void solve(int testNumber, Scanner in, PrintWriter out) {
            int N = in.nextInt();
            int A[] = new int[N];
            int computed[] = new int[1000005];

            for (int i = 0; i < N; i++) {
                A[i] = in.nextInt();
            }
            for (int x : A) {
                if (computed[x] != 0) {
                    computed[x] = 2;
                    continue;
                }
                for (int i = x; i < 1000005; i += x) {
                    computed[i]++;
                }
            }
            int ans = 0;
            for (int x : A) {
                if (computed[x] == 1) {
                    ans++;
                }
            }
            out.println(ans);

        }

    }
}

