{"trustable":true,"sections":[{"title":"","value":{"format":"HTML","content":"\u003cdiv class\u003d\"problem_par\"\u003e\u003cdiv class\u003d\"problem_par_normal\"\u003eAs you remember, when Vasechkin was preparing a problem for the latest student\r\ncontest, he spent a lot of time trying to invent an unusual and complex name\r\nfor this problem. The name that Vasechkin had invented was so complex that none\r\nof the participants of that contest even started reading the statement of his\r\nproblem.\r\n\u003c/div\u003e\u003c/div\u003e\u003cdiv class\u003d\"problem_par\"\u003e\u003cdiv class\u003d\"problem_par_normal\"\u003eAfter the contest, Chairman of the program committee announced that he refused\r\nto take part in the preparation of contests as long as such inappropriate\r\npeople as Vasechkin worked on the program committee. That was how Vasechkin\r\nbecame the new Chairman of the program committee, and now he is preparing the\r\nnext programming contest.\r\n\u003c/div\u003e\u003c/div\u003e\u003cdiv class\u003d\"problem_par\"\u003e\u003cdiv class\u003d\"problem_par_normal\"\u003eVasechkin has decided that this time the names of all the problems will consist\r\nof the letters \u003ccode\u003ea\u003c/code\u003e, \u003ccode\u003eb\u003c/code\u003e, and \u003ccode\u003ec\u003c/code\u003e only and the length of each name will\r\nbe equal to \u003ci\u003en\u003c/i\u003e. In addition, the names must be \u003ci\u003eextremely complex\u003c/i\u003e. A name is\r\nextremely complex if none of its substrings consisting of at least two symbols\r\nis a palindrome. Help Vasechkin find all extremely complex names for the\r\nproblems of the contest.\r\n\u003c/div\u003e\u003c/div\u003e"}},{"title":"Input","value":{"format":"HTML","content":"\u003cdiv class\u003d\"problem_par\"\u003e\u003cdiv class\u003d\"problem_par_normal\"\u003eThe only input line contains the integer \u003ci\u003en\u003c/i\u003e (1 ≤ \u003ci\u003en\u003c/i\u003e ≤ 20000).\r\n\u003c/div\u003e\u003c/div\u003e"}},{"title":"Output","value":{"format":"HTML","content":"\u003cdiv class\u003d\"problem_par\"\u003e\u003cdiv class\u003d\"problem_par_normal\"\u003eOutput all different extremely complex names of length \u003ci\u003en\u003c/i\u003e\r\nconsisting of the letters \u003ccode\u003ea\u003c/code\u003e, \u003ccode\u003eb\u003c/code\u003e, and \u003ccode\u003ec\u003c/code\u003e only. The names should be given in\r\nthe alphabetical order, one per line. If the total length of the names exceeds\r\n100000 letters, output the only line “TOO LONG”.\r\n\u003c/div\u003e\u003c/div\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\n\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003eab\r\nac\r\nba\r\nbc\r\nca\r\ncb\r\n\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n"}}]}