{"trustable":true,"sections":[{"title":"","value":{"format":"MD","content":"\u003cp\u003e\nDo you know that The Chef has a special interest in palindromes? Yes he does! Almost all of the dishes in his restaurant is named by a palindrome strings. The problem is that a name of a dish should not be too long, so The Chef has only limited choices when naming a new dish.\n\u003c/p\u003e\n\n\u003cp\u003e\nFor the given positive integer \u003cb\u003eN\u003c/b\u003e, your task is to calculate the number of palindrome strings of length not exceeding \u003cb\u003eN\u003c/b\u003e, that contain only lowercase letters of English alphabet (letters from \u0027a\u0027 to \u0027z\u0027, inclusive). Recall that a palindrome is a string that reads the same left to right as right to left (as in \"radar\").\n\u003c/p\u003e\n\n\u003cp\u003e\nFor example:\n\u003c/p\u003e\u003cul\u003e\u003cli\u003eFor \u003cb\u003eN \u003d 1\u003c/b\u003e, we have \u003cb\u003e26\u003c/b\u003e different palindromes of length not exceeding \u003cb\u003eN\u003c/b\u003e:\u003cbr /\u003e \"a\", \"b\", ..., \"z\".\u003c/li\u003e\n\u003cli\u003eFor \u003cb\u003eN \u003d 2\u003c/b\u003e we have \u003cb\u003e52\u003c/b\u003e different palindromes of length not exceeding \u003cb\u003eN\u003c/b\u003e:\u003cbr /\u003e \"a\", \"b\", ..., \"z\",\u003cbr /\u003e \"aa\", \"bb\", ..., \"zz\".\u003c/li\u003e\n\u003cli\u003eFor \u003cb\u003eN \u003d 3\u003c/b\u003e we have \u003cb\u003e728\u003c/b\u003e different palindromes of length not exceeding \u003cb\u003eN\u003c/b\u003e:\u003cbr /\u003e \"a\", \"b\", ..., \"z\",\u003cbr /\u003e \"aa\", \"bb\", ..., \"zz\",\u003cbr /\u003e \"aaa\", \"aba\", ..., \"aza\",\u003cbr /\u003e \"bab\", \"bbb\", ..., \"bzb\",\u003cbr /\u003e ...,\u003cbr /\u003e \"zaz\", \"zbz\", ..., \"zzz\".\u003c/li\u003e\n\u003c/ul\u003e\u003cp\u003e\nSince the answer can be quite large you should output it modulo \u003cb\u003e1000000007\u003c/b\u003e (\u003cb\u003e10\u003csup\u003e9\u003c/sup\u003e + 7\u003c/b\u003e). Yes, we know, most of you already hate this modulo, but there is nothing we can do with it :)\n\u003c/p\u003e\n\n\u003ch3\u003eInput\u003c/h3\u003e\n\u003cp\u003e\nThe first line of the input contains an integer \u003cb\u003eT\u003c/b\u003e denoting the number of test cases. The description of \u003cb\u003eT\u003c/b\u003e test cases follows. The only line of each test case contains a single integer \u003cb\u003eN\u003c/b\u003e.\n\u003c/p\u003e\n\n\u003ch3\u003eOutput\u003c/h3\u003e\n\u003cp\u003e\nFor each test case, output a single line containing the answer for the corresponding test case.\n\u003c/p\u003e\n\n\u003ch3\u003eConstrains\u003c/h3\u003e\n\u003cp\u003e\u003c/p\u003e\u003cul\u003e\u003cli\u003e\u003cb\u003e1\u003c/b\u003e ≤ \u003cb\u003eT\u003c/b\u003e ≤ \u003cb\u003e1000\u003c/b\u003e\u003c/li\u003e\n\u003cli\u003e\u003cb\u003e1\u003c/b\u003e ≤ \u003cb\u003eN\u003c/b\u003e ≤ \u003cb\u003e10\u003csup\u003e9\u003c/sup\u003e\u003c/b\u003e\u003c/li\u003e\n\u003c/ul\u003e"}},{"title":"Sample 1","value":{"format":"MD","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\u003e5\n1\n2\n3\n4\n100\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003e26\n52\n728\n1404\n508533804\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n\u003cp\u003e\nThe first three examples are explained in the problem statement above.\n\u003c/p\u003e"}}]}