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.ArrayDeque;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Comparator;
import java.util.HashMap;
import java.util.HashSet;
import java.util.List;
import java.util.Map;
import java.util.Queue;
import java.util.Scanner;
import java.util.Set;

public class Main {

	public static void main(String[] args) {
		execute15_1();
	}
	
	private static void execute15_1() {
		try (Scanner sc = new Scanner(System.in)) {
			int n = sc.nextInt();
			int [] a = new int[n];
			int max = 1000009;
			
			int[] cannt = new int[max];
			
			for(int i=0;i<max;i++) {
				cannt[i]=0;
			}
			for(int i=0; i<n; i++) {
				 a[i] = sc.nextInt();
				int c = 1;
				if(cannt[a[i]] != 0) {
					cannt[a[i]]++;
					continue;
				}
				while(a[i]*c<max) {
					cannt[a[i]*c]++;
					c++;
				}
			}
			
			int ans =n;
			
			for(int i=0; i<n; i++) {
				if(cannt[a[i]]>0) {
					if(cannt[a[i]]==1) continue;
					ans--;
				}
			}
			
			System.out.println(ans);
		}

	}
}