{"raw_statement":[{"iden":"problem statement","content":"We have a sequence of length $1$: $A=(X)$. Let us perform the following operation on this sequence $10^{100}$ times.\nOperation: Let $Y$ be the element at the end of $A$. Choose an integer between $1$ and $\\sqrt{Y}$ (inclusive), and append it to the end of $A$.\nHow many sequences are there that can result from $10^{100}$ operations?\nYou will be given $T$ test cases to solve.\nIt can be proved that the answer is less than $2^{63}$ under the Constraints."},{"iden":"constraints","content":"*   $1 \\leq T \\leq 20$\n*   $1 \\leq X \\leq 9\\times 10^{18}$\n*   All values in input are integers."},{"iden":"input","content":"Input is given from Standard Input in the following format:\n\n$T$\n$\\rm case_1$\n$\\vdots$\n$\\rm case_T$\n\nEach case is in the following format:\n\n$X$"},{"iden":"sample input 1","content":"4\n16\n1\n123456789012\n1000000000000000000"},{"iden":"sample output 1","content":"5\n1\n4555793983\n23561347048791096\n\nIn the first case, the following five sequences can result from the operations.\n\n*   $(16,4,2,1,1,1,\\ldots)$\n*   $(16,4,1,1,1,1,\\ldots)$\n*   $(16,3,1,1,1,1,\\ldots)$\n*   $(16,2,1,1,1,1,\\ldots)$\n*   $(16,1,1,1,1,1,\\ldots)$"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}