Problem Statement

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.