{"trustable":true,"prependHtml":"\u003cstyle type\u003d\u0027text/css\u0027\u003e\n .input, .output {\n border: 1px solid #888888;\n }\n .output {\n margin-bottom: 1em;\n position: relative;\n top: -1px;\n }\n .output pre, .input pre {\n background-color: #EFEFEF;\n line-height: 1.25em;\n margin: 0;\n padding: 0.25em;\n }\n \u003c/style\u003e\n \u003clink rel\u003d\"stylesheet\" href\u003d\"//codeforces.org/s/96598/css/problem-statement.css\" type\u003d\"text/css\" /\u003e\n\u003cscript\u003e\n window.katexOptions \u003d {\n delimiters: [\n {left: \u0027$$$$$$\u0027, right: \u0027$$$$$$\u0027, display: true},\n {left: \u0027$$$\u0027, right: \u0027$$$\u0027, display: false},\n {left: \u0027$$\u0027, right: \u0027$$\u0027, display: true},\n {left: \u0027$\u0027, right: \u0027$\u0027, display: false}\n ]\n };\n\u003c/script\u003e\n","sections":[{"title":"","value":{"format":"HTML","content":"\u003cp\u003eA binary tree $$$T$$$ is called \u003cspan class\u003d\"tex-font-style-bf\"\u003esuper balanced\u003c/span\u003e if $$$T$$$ is empty or satisfies the following three conditions at the same time:\u003c/p\u003e\u003col\u003e \u003cli\u003e The left subtree of $$$T$$$ is super balanced. \u003c/li\u003e\u003cli\u003e The right subtree of $$$T$$$ is super balanced. \u003c/li\u003e\u003cli\u003e The number of nodes of the left subtree and the right subtree differs at most $$$1$$$. \u003c/li\u003e\u003c/ol\u003e\u003cp\u003ePlease calculate the number of \u003cspan class\u003d\"tex-font-style-bf\"\u003esuper balanced\u003c/span\u003e trees consisting of $$$n$$$ nodes. Since the answer can be very large, just output the answer modulo $$$2^{64}$$$.\u003c/p\u003e"}},{"title":"Input","value":{"format":"HTML","content":"\u003cp\u003eThe first line contains a single integer $$$T$$$ ($$$1\\le T\\le 10^6$$$), indicating the number of test cases. \u003c/p\u003e\u003cp\u003eEach test case contains a single integer $$$n$$$ ($$$0 \\le n \u0026lt; 2 ^{64}$$$), indicating the number of nodes in the tree.\u003c/p\u003e"}},{"title":"Output","value":{"format":"HTML","content":"\u003cp\u003eFor each test case, output an integer in a single line indicating the number of super balanced trees consisting of $$$n$$$ nodes.\u003c/p\u003e"}},{"title":"Examples","value":{"format":"HTML","content":"\u003ctable class\u003d\u0027vjudge_sample\u0027\u003e\n\u003cthead\u003e\n \u003ctr\u003e\n \u003cth\u003eInput\u003c/th\u003e\n \u003cth\u003eOutput\u003c/th\u003e\n \u003c/tr\u003e\n\u003c/thead\u003e\n\u003ctbody\u003e\n \u003ctr\u003e\n \u003ctd\u003e\u003cpre\u003e2\n2\n3\n\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003e2\n1\n\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n"}}]}