indivisibility

Problem Description

You have an array of Q integers.

Dae Koon sees your array of integers and wonders, for each integer in the array A_i, how many integers from 1 to A_i (inclusive) are not divisible by any integer from 2 to 10 (inclusive)?

Input

The first line of input contains a single integer Q.

The next line contains Q integers, the ith integer is the value of A_i.

Output

Output Q lines, with one integer on each line.

The integer on the ith line should be the answer to Dae Koon's question for A_i.

Limits

Subtask 1 (100%): 1 ≤ Q ≤ 10⁶. 2 ≤ A_i ≤ 10¹⁸.

Subtask 2 (0%): Sample Testcases

Sample Testcase 1

Input

1
12

Output

2