Killjee has a list of $12$ numbers and he wants to find how many unique numbers are there which are $\le N$. A number is said to be unque if it is divisible by any of number in Killjee's list.

INPUT CONSTRAINTS

• $1 \le N \le 10^{18}$
• $1 \le$ number in killjee's list $\le 30$

INPUT FORMAT

First line of input contains a single integer N, second line contains 12 space separated integers, number of Killjee's list.

OUTPUT FORMAT

Print answer to the problem.