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 IOException {
		// TODO Auto-generated method stub
		BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
		String[] cmd=br.readLine().split(" ");
		int n=Integer.valueOf(cmd[0]);
		cmd=br.readLine().split(" ");
		int[] cnt=new int[1000001];
		HashMap<Integer,Integer> check=new HashMap<>();
		HashMap<Integer,Integer> map=new HashMap<>();
		int[] arr=new int[n];
		int max=0;
		for(int i=0;i<n;i++)
		{
			arr[i]=Integer.valueOf(cmd[i]);
			cnt[arr[i]]++;
			if(!map.containsKey(arr[i]))
			map.put(arr[i], 1);
			if(max<arr[i])
				max=arr[i];
		}
		for(int i=0;i<n;i++)
		{
			int x=arr[i];
			int y=max/arr[i];
			if(cnt[x]>1)
			{
				if(!check.containsKey(x))
					check.put(x,1);
			}
			for(int j=2;j<=y;j++)
			{
				if(map.containsKey(j*x))
				{
					if(!check.containsKey(j*x))
					check.put(j*x,1);
				}
			}
		}
		int ans=0;
		for(int i=0;i<n;i++)
		{
			if(!check.containsKey(arr[i]))
				ans++;
		}
		System.out.println(ans);
	}

}
