B"Consider a game with n cards ( n is even). Each card has a number written on it, between 1 and n . All numbers on the cards are different. We say that a card with number x is stronger than a card with number y if x > y . Two players, Alex and Boris, play this game. In the beginning, each of them receives exactly frac{n}{2} cards, so each card belongs to exactly one player. Then, they take turns. Alex goes first, then Boris, then Alex again, and so on. On a player's turn, he must play exactly one of his cards. Then, if the opponent doesn't have any cards stronger than the card played, the opponent loses, and the game ends. Otherwise, the opponent has to play a stronger card (exactly one card as well). These two cards are removed from the game, and the turn ends. If there are no cards left, the game ends in a draw; otherwise it's the opponent's turn. Consider all possible ways to distribute the cards between two players, so that each of them receives exactly half of the cards. You have to calculate three numbers: You may assume that both players play optimally (i. xe2 x80 x89e. if a player can win no matter how his opponent plays, he wins). Two ways to distribute the cards are different if there is at least one card such that, in one of these ways, it is given to Alex, and in the other way, it is given to Boris. For example, suppose n = 4 , Alex receives the cards [2, 3] , and Boris receives the cards [1, 4] . Then the game may go as follows: So, in this case, the game ends in a draw. The first line contains one integer t ( 1 <= t <= 30 ) -- the number of test cases. Then, t lines follow. The i -th line contains one even integer n ( 2 <= n <= 60 ). For each test case, print three integers: Since the answers can be large, print them modulo 998244353 . In the first test case, Alex wins if he receives the card 2 (he plays it, and Boris cannot respond). If Alex re"...