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.io.*;
public class Main {

	public static void main(String[] args) throws Exception{
		int num = 998244353;

		// TODO Auto-generated method stub
 		BufferedReader bf = new BufferedReader(new InputStreamReader(System.in));
 		PrintWriter out = new PrintWriter(System.out);
 		int n = Integer.parseInt(bf.readLine());
 		Map<Integer, Integer> graph = new HashMap<Integer, Integer>();
	 		Set<Integer> no = new HashSet<Integer>();
	 		StringTokenizer st1 = new StringTokenizer(bf.readLine());
	 		ArrayList<Integer> array = new ArrayList<Integer>();
	 		for(int i = 0;i<n;i++){
	 			array.add(Integer.parseInt(st1.nextToken()));
	 			no.add(array.get(i));
	 			if (graph.containsKey(array.get(i))){
	 				graph.put(array.get(i), graph.get(array.get(i))+1);
	 			}
	 			else{
	 				graph.put(array.get(i), 1);
	 			}
	 		}
	 	int removecount = 0;
	 	for(int i : array){
	 		ArrayList<Integer> factors = new ArrayList<Integer>();
	 		for(int j = 1;j*j <= i;j++){
	 			if (i%j == 0){
		 			factors.add(j);
		 			factors.add(i/j);
	 			}
	 		}
	 		for(int j : factors){
	 			if (j!= i && graph.containsKey(j)){
	 				removecount++;
	 				break;
	 			}
	 			else if (j == i && graph.containsKey(j) && graph.get(j) >1){
	 				removecount++;
	 				break;
	 			}
	 		}
	 		
	 	}
	 	out.println(n-removecount);
	 	
	 		
 		out.close();
 		
 		
 		
 	}
}
 	
 
//StringJoiner sj = new StringJoiner(" "); 
//sj.add(strings)
//sj.toString() gives string of those stuff w spaces or whatever that sequence is

 		
 		
 		
 		
	


