#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;

int n,a[200010],ans=0;
bool f[2000010]={};



int main(){
	ios::sync_with_stdio(false);
	cin>>n;
	int i,j;
	for(i=1;i<=n;++i)
		cin>>a[i];
	sort(a+1,a+1+n);
	for(i=1;i<=n;++i){
		if(!f[a[i]]){
			++ans;
			for(j=1;j*a[i]<=a[n];++j)
				f[a[i]*j]=1;
			if(a[i]==a[i+1])
				--ans;
		}
	}
	cout<<ans;
	
	return 0;
}
### Prompt

Develop a solution in Cpp to the problem described below:

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

### Response

```cpp
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;

int n,a[200010],ans=0;
bool f[2000010]={};



int main(){
	ios::sync_with_stdio(false);
	cin>>n;
	int i,j;
	for(i=1;i<=n;++i)
		cin>>a[i];
	sort(a+1,a+1+n);
	for(i=1;i<=n;++i){
		if(!f[a[i]]){
			++ans;
			for(j=1;j*a[i]<=a[n];++j)
				f[a[i]*j]=1;
			if(a[i]==a[i+1])
				--ans;
		}
	}
	cout<<ans;
	
	return 0;
}
```