#include <cstdio>
#include <algorithm>
using namespace std;
bool a[1000010];
int b[200010],n,cnt;
int main(){
	scanf("%d",&n);
	for(int i=1;i<=n;++i){
		scanf("%d",b+i);
	}
	sort(b+1,b+1+n);
	b[n+1]=1e9;
	for(int i=1;i<=n;++i){
		if(!a[b[i]]){
			a[b[i]]=true;
			if(b[i+1]>b[i]){
				++cnt;
			}
			for(int j=2*b[i];j<=1e6;j+=b[i]){
				a[j]=true;
			}
		}
	}
	printf("%d\n",cnt);
	return 0;
}

### Prompt

Please formulate a Cpp solution to the following problem:

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 <cstdio>
#include <algorithm>
using namespace std;
bool a[1000010];
int b[200010],n,cnt;
int main(){
	scanf("%d",&n);
	for(int i=1;i<=n;++i){
		scanf("%d",b+i);
	}
	sort(b+1,b+1+n);
	b[n+1]=1e9;
	for(int i=1;i<=n;++i){
		if(!a[b[i]]){
			a[b[i]]=true;
			if(b[i+1]>b[i]){
				++cnt;
			}
			for(int j=2*b[i];j<=1e6;j+=b[i]){
				a[j]=true;
			}
		}
	}
	printf("%d\n",cnt);
	return 0;
}

```