{"trustable":false,"sections":[{"title":"","value":{"format":"HTML","content":"\u003cbr\u003e\u003ccenter\u003e\u003cimg src\u003d\"CDN_BASE_URL/91cd2a849209448a71d50fa577e5d5ed?v\u003d1688341829\"\u003e\u003c/center\u003e"}},{"title":"Input","value":{"format":"HTML","content":"The input contains several test cases. \u003cbr\u003e Each test case is made up of two integer numbers: the height h and the width w of the large rectangle.\n\u003cbr\u003e\nInput is terminated by $h\u003dw\u003d0$. Otherwise, $1 \\le \u003dh,w \\le\u003d11$. "}},{"title":"Output","value":{"format":"HTML","content":"\u003cimg src\u003d\"CDN_BASE_URL/9275391b5c2fd4e3cb556e4ab10140b5?v\u003d1688341829\" align\u003d\"right\"\u003eFor each test case, output the number of different ways the given rectangle can be filled with small rectangles of size 2 times 1. Assume the given large rectangle is oriented, i.e. count symmetrical tilings multiple times. "}},{"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\u003e1 2\n1 3\n1 4\n2 2\n2 3\n2 4\n2 11\n4 11\n0 0\n\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003e1\n0\n1\n2\n3\n5\n144\n51205\n\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n"}}]}