#include <iostream>
#define MAXA 1000000
using namespace std;
int main(){
	int cnt[MAXA+1] = {0};
	int N, A, ans;
	cin >> N;
	for(ans = N; N; N--){
		cin >> A;
		cnt[A]++;
	}
	for(int i=1; i<=MAXA; i++){
		if(cnt[i] > 1)
			ans -= cnt[i];
		if(cnt[i])
			for(int j=i+i; j<=MAXA; j+=i)
				if(cnt[j]){
					ans -= cnt[j];
					cnt[j] = 0;
				}
	}
	cout << ans << endl;
}


	


### 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 <iostream>
#define MAXA 1000000
using namespace std;
int main(){
	int cnt[MAXA+1] = {0};
	int N, A, ans;
	cin >> N;
	for(ans = N; N; N--){
		cin >> A;
		cnt[A]++;
	}
	for(int i=1; i<=MAXA; i++){
		if(cnt[i] > 1)
			ans -= cnt[i];
		if(cnt[i])
			for(int j=i+i; j<=MAXA; j+=i)
				if(cnt[j]){
					ans -= cnt[j];
					cnt[j] = 0;
				}
	}
	cout << ans << endl;
}


	


```