{"trustable":true,"prependHtml":"\u003cscript\u003e window.katexOptions \u003d { disable: true }; \u003c/script\u003e\n\u003cscript type\u003d\"text/x-mathjax-config\"\u003e\n MathJax.Hub.Config({\n tex2jax: {\n inlineMath: [[\u0027$$$\u0027,\u0027$$$\u0027], [\u0027$\u0027,\u0027$\u0027]],\n displayMath: [[\u0027$$$$$$\u0027,\u0027$$$$$$\u0027], [\u0027$$\u0027,\u0027$$\u0027]]\n }\n });\n\u003c/script\u003e\n\u003cscript async src\u003d\"https://mathjax.codeforces.org/MathJax.js?config\u003dTeX-AMS-MML_HTMLorMML\" type\u003d\"text/javascript\"\u003e\u003c/script\u003e","sections":[{"title":"","value":{"format":"HTML","content":"\u003cdiv class\u003d\"panel_content\"\u003eHave become a sophomore, WNJXYK found that his recent combinatorial mathematics homework is too hard. Homework always matters a lot. To get high grades, he has no choice but to ask you for help. \u003cbr\u003eHere is the problem: Can you calculate the numbers of ways to put 2$n$ different balls into exact same boxes and each box contains exactly 2 balls.\u003c/div\u003e"}},{"title":"Input","value":{"format":"HTML","content":"The input starts with one line contains exactly one positive integer $T$ which is the number of test cases.\u003cbr\u003eEach test case contains one line with exactly one positive integer $n$ which has been explained above."}},{"title":"Output","value":{"format":"HTML","content":"For each test case, output one line containing “y” where y is the number of different ways modulo 2^64."}},{"title":"Sample","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\u003e3\r\n1\r\n2\r\n100\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003e1\r\n3\r\n7119879074588212521\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n"}},{"title":"Hint","value":{"format":"HTML","content":"\u003cbr\u003e1\u0026lt;\u003dT\u0026lt;\u003d10,1\u0026lt;\u003dN\u0026lt;\u003d10^18\u003cbr\u003eFor test case 1, it is obviously that there is only one way to do so.\u003cbr\u003eFor test case 2, we could assume that 4 different are indexed from 1 to 4. Three different splitting ways are {{1,2}, {3,4}}, {{1,3}, {2,4}} and {{1,4}, {2,3}}.\u003cbr\u003e"}}]}