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

public class Main {

    Scanner sc = new Scanner(System.in);

    public static void main(String[] args) {
        new Main().run();
    }

    void run() {

        int n = sc.nextInt();
        int[] arr = new int[n];
        Map<Integer, Integer> map = new HashMap<>();
        for (int i=0; i<n; i++) {
            arr[i] = sc.nextInt();
            if (map.containsKey(arr[i])) {
                map.put(arr[i], map.get(arr[i])+1);
            } else {
                map.put(arr[i], 1);
            }
        }
        Arrays.sort(arr);

//        List<Integer> list = new ArrayList<>();
//        for (int i=0; i<n; i++) list.add(sc.nextInt());
//        Collections.sort(list);

        int cnt = 0;

        int max = arr[n-1]+1;
        boolean[] flag = new boolean[max+1];
        for (int i=0; i<n; i++) flag[arr[i]] = true;
        int sqrt = (int)Math.sqrt(max+1);

        for (int i=0; i<n; i++) {
            int tmp = arr[i];
            if (flag[tmp]) {
                for (int j=tmp*2; j<=max; j+=tmp) {
                    flag[j] = false;
                }
            }
            if (map.get(tmp)!=1) flag[tmp] = false;
        }

        for (int i=0; i<flag.length; i++) {
//            System.out.println(flag[i] + " ");
            if (flag[i]) cnt++;
        }

        System.out.println(cnt);
    }


}
