P14663 Multiple Problem

Given $T$ queries, each contains a positive integer $n$. Find the all of the integer $m$ that satisfy the following conditions: - $1 \le m \le n$ - $m$ is a **perfect square number** - $m$ is a multiple of $3$ Find the quantity of $m$.

**Each test case contains multiple data sets.** You will only receive the score for a test case if you pass all its data sets. The first line contains an integer $T$. The next $T$ lines each contains an integer $n$.

$T$ lines, the quantity of $m$.

### Example explanation There are a total of three queries. - For the first query, $m$ is $9$; - For the second query, all $m$ are $9, 36$; - For the third query, all $m$ are $9, 36, 81$. ### Data Volume and Conventions **This problem is divided into subtasks.** Your score in a subtask is the minimum score across all its test cases. **This problem uses subtask dependencies.** You will not receive the score for a subtask unless you achieve full points on all its dependent subtasks.  | Subtask | $n \le$ | Score | Dependencies | |:-----:|:-----:|:-----:|:-----:| | $1$ | $3 \times 10^5$ | $20$ | none | | $2$ | $10^{14}$ | $30$ | $1$ | | $3$ | $10^{18}$ | $50$ | $1,2$ | For all of the cases, $1 \le T \le 3 \times 10^5,1 \le n \le 10^{18}$.