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

public class Main {

    public static void main(String[] args) {
        Scanner scan = new Scanner(System.in);
        int n = Integer.parseInt(scan.next());
        Set<Integer> set = new HashSet<Integer>();
        Map<Integer, Integer> map = new HashMap<Integer, Integer>();
        for (int i = 0; i < n; i++) {
            int a = Integer.parseInt(scan.next());
            map.put(a, 1);
            if (set.contains(a)) {
                map.put(a, 0);
            } else {
                set.add(a);
            }
        }
        scan.close();

        int ans = 0;
        for (int a : set) {
            if (map.get(a) == 0) {
                continue;
            }
            if (a == 1) {
                ans++;
                continue;
            }
            if (set.contains(1)) {
                continue;
            }

            boolean isOK = true;
            for (int j = 2; j <= Math.sqrt(a); j++) {
                if (a % j == 0) {
                    if (set.contains(j) || set.contains(a / j)) {
                        isOK = false;
                        break;
                    }
                }
            }
            if (isOK) {
                ans++;
            }
        }

        System.out.println(ans);
    }
}
