{"trustable":true,"prependHtml":"\u003cscript async src\u003d\"https://mathjax.codeforces.org/MathJax.js?config\u003dTeX-AMS-MML_HTMLorMML\" type\u003d\"text/javascript\" /\u003e\n\u003cscript\u003e\n window.katexOptions \u003d { disable: true };\n\u003c/script\u003e\n","sections":[{"title":"","value":{"format":"HTML","content":"\u003cdiv class\u003d\"panel_content\"\u003eA positive integer x can represent as $(a_1a_2 \\ldots a_ka_k \\ldots a_2a_1)_{10}$ or $(a_1a_2 \\ldots a_{k-1}a_ka_{k-1} \\ldots a_2a_1)_{10}$ of a 10-based notational system, we always call x is a Palindrome Number. If it satisfies $0\u0026lt;a_1\u0026lt;a_2\u0026lt; \\ldots\u0026lt;a_k \\leq 9$, we call x is a Beautiful Palindrome Number.\u003cbr\u003eNow, we want to know how many Beautiful Palindrome Numbers are between 1 and $10^N$.\u003c/div\u003e"}},{"title":"Input","value":{"format":"HTML","content":"The first line in the input file is an integer $T(1 \\leq T \\leq 7)$, indicating the number of test cases.\u003cbr\u003eThen T lines follow, each line represent an integer $N(0 \\leq N \\leq 6)$."}},{"title":"Output","value":{"format":"HTML","content":"For each test case, output the number of Beautiful Palindrome Number."}},{"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\u003e2\r\n1\r\n6\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003e9\r\n258\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n"}}]}