{"trustable":true,"sections":[{"title":"","value":{"format":"HTML","content":"\u003cimg src\u003d\"CDN_BASE_URL/3e4ac61ffa504283fa6f7d9e99296af7?v\u003d1725970277\" align\u003d\"right\" hspace\u003d\"10\"\u003e\u003cspan lang\u003d\"en-us\"\u003e\u003cp\u003eA bee larva living in a hexagonal cell of a large honeycomb decides to creep for a walk. In each “step” the larva may move into any of the six adjacent cells and after \u003ci\u003en\u003c/i\u003e steps, it is to end up in its original cell.\u003c/p\u003e\u003cp\u003eYour program has to compute, for a given \u003ci\u003en\u003c/i\u003e, the number of different such larva walks.\u003c/p\u003e\u003c/span\u003e"}},{"title":"Input","value":{"format":"HTML","content":"\u003cspan lang\u003d\"en-us\"\u003e\u003cp\u003eThe first line contains an integer giving the number of test cases to follow. Each case consists of one line containing an integer \u003ci\u003en\u003c/i\u003e, where 1 ≤ \u003ci\u003en\u003c/i\u003e ≤ 14.\u003c/p\u003e\u003c/span\u003e"}},{"title":"Output","value":{"format":"HTML","content":"\u003cspan lang\u003d\"en-us\"\u003e\u003cp\u003eFor each test case, output one line containing the number of walks. Under the assumption 1 ≤ \u003ci\u003en\u003c/i\u003e ≤ 14, the answer will be less than 2\u003csup\u003e31\u003c/sup\u003e.\u003c/p\u003e\u003c/span\u003e"}},{"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\n2\r\n4\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003e6\r\n90\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n"}}]}