### ** 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 *i*th integer is the value of *A*_{i}.

## Output

Output *Q* lines, with one integer on each line.

The integer on the *i*th line should be the answer to Dae Koon's question for *A*_{i}.

## Limits

Subtask 1 (100%): 1 ≤ *Q* ≤ 10^{6}. 2 ≤ *A*_{i} ≤ 10^{18}.

Subtask 2 (0%): Sample Testcases

## Sample Testcase 1

### Input

1
12

### Output

2