#include<bits/stdc++.h>
using namespace std;
const int LIM=1e6;
bool Ban[LIM+10];
int N,A[LIM+10];
int main(){
    cin>>N;
    for(int i=1;i<=N;i++)
        cin>>A[i];
    sort(A+1,A+1+N);
    
    int Cnt=0;
    for(int i=1;i<=N;i++)
        if(!Ban[ A[i] ]){
            Cnt+=(A[i]!=A[i+1]);
            for(int j=A[i];j<=LIM;j+=A[i])
                Ban[j]=1;
        }
    cout<<Cnt;
    return 0;
}
### Prompt

Your challenge is to write 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<bits/stdc++.h>
using namespace std;
const int LIM=1e6;
bool Ban[LIM+10];
int N,A[LIM+10];
int main(){
    cin>>N;
    for(int i=1;i<=N;i++)
        cin>>A[i];
    sort(A+1,A+1+N);
    
    int Cnt=0;
    for(int i=1;i<=N;i++)
        if(!Ban[ A[i] ]){
            Cnt+=(A[i]!=A[i+1]);
            for(int j=A[i];j<=LIM;j+=A[i])
                Ban[j]=1;
        }
    cout<<Cnt;
    return 0;
}
```