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.HashMap;
import java.util.Map;
import java.util.Scanner;

public class Main {

    public static void main(String[] args) {
        @SuppressWarnings("resource")
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int[] a = new int[n];
        Map<Integer, Integer> map = new HashMap<>();
        for (int i = 0; i < n; i++) {
            a[i] = sc.nextInt();
            if (map.containsKey(a[i])) {
                map.put(a[i], map.get(a[i]) + 1);
            } else {
                map.put(a[i], 1);
            }
        }
        int c = 0;
        for (int i = 0; i < n; i++) {
            int x = a[i];
            boolean flg = true;
            for (int j = 2 ; j * j <= x; j++) {
                if (x % j == 0) {
                    if (map.containsKey(j)) {
                        flg = false;
                    }
                    if (map.containsKey(x / j)) {
                        flg = false;
                    }
                }
            }
            if (map.get(x) > 1) {
                flg = false;
            }
            if (flg) {
                c++;
            }
        }
        if (n == 1) {
            System.out.println(1);
            return;
        }
        if (map.size() == 1) {
            System.out.println(0);
            return;
        }
        if (map.containsKey(1) && map.get(1) == 1) {
            System.out.println(1);
            return;
        }
        if (map.containsKey(1) && map.get(1) > 1) {
            System.out.println(0);
            return;
        }

        System.out.println(c);

    }

}