#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
#define repl(i, l, r) for (int i = (l); i < (r); i++)
#define rep(i, n) repl(i, 0, n)
const int MAX = 1000005;
int n, a[200000], P[MAX];
int main() {
	scanf("%d", &n);
	rep(i, n) {
		scanf("%d", a + i);
		P[a[i]]++;
	}
	int ans = 0;
	rep(i, MAX) {
		if (P[i] == 1) ans++;
		if (P[i])
			for (int j = 2; j * i < MAX; j++) P[j * i] = 0;
	}
	printf("%d\n", ans);
	return 0;
}
### Prompt

In CPP, your task is to solve 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 <algorithm>
#include <iostream>
#include <vector>
using namespace std;
#define repl(i, l, r) for (int i = (l); i < (r); i++)
#define rep(i, n) repl(i, 0, n)
const int MAX = 1000005;
int n, a[200000], P[MAX];
int main() {
	scanf("%d", &n);
	rep(i, n) {
		scanf("%d", a + i);
		P[a[i]]++;
	}
	int ans = 0;
	rep(i, MAX) {
		if (P[i] == 1) ans++;
		if (P[i])
			for (int j = 2; j * i < MAX; j++) P[j * i] = 0;
	}
	printf("%d\n", ans);
	return 0;
}
```