{"trustable":true,"sections":[{"title":"","value":{"format":"HTML","content":"\u003cdiv class\u003d\"problem_par\"\u003e\u003cdiv class\u003d\"problem_par_normal\"\u003eThere is a game called \"Yoga\". On the game board there are 32 checkers, standing as shown on the picture. \r\nEach turn a checker jumps over another one and lands on a free cell\u0026nbsp;— almost like in the\r\nchecker game, but vertically or horizontally, not diagonally. The checker which was jumped over is removed\r\nfrom the board.\u003c/div\u003e\u003c/div\u003e\u003cdiv class\u003d\"problem_centered_picture\"\u003e\u003cimg src\u003d\"CDN_BASE_URL/3f1c1fc61d5921b58db17132b39df24a?v\u003d1716043737\" border\u003d\"0\" alt\u003d\"Problem illustration\"\u003e\u003c/div\u003e\u003cdiv class\u003d\"problem_par\"\u003e\u003cdiv class\u003d\"problem_par_normal\"\u003eWe will look at endspiel, the last part of the game. Imagine that there is only one checker left.\r\nGiven its location, find a possible sequence of turns that leads to this endspiel.\u003c/div\u003e\u003c/div\u003e"}},{"title":"Input","value":{"format":"HTML","content":"\u003cdiv class\u003d\"problem_par\"\u003e\u003cdiv class\u003d\"problem_par_normal\"\u003eLet us introduce a coordinate system similar to the one that is used in the game of chess. The columns are numbered by Latin letters from A to G, the rows are numbered from 1 to 7. For example, a cell with coordinates \"D4\" is the central cell.\u003c/div\u003e\u003c/div\u003e\u003cdiv class\u003d\"problem_par\"\u003e\u003cdiv class\u003d\"problem_par_normal\"\u003eThe first line contains the coordinates of the last checker\r\nin the notation described above.\u003c/div\u003e\u003c/div\u003e"}},{"title":"Output","value":{"format":"HTML","content":"\u003cdiv class\u003d\"problem_par\"\u003e\u003cdiv class\u003d\"problem_par_normal\"\u003eIf it is possible to reach the specified endspiel, output the sequence of turns leading to it. Each turn should be printed in the following format: \u0026lt;\u003ci\u003estart\u0026nbsp;cell\u003c/i\u003e\u0026gt;–\u0026lt;\u003ci\u003efinish\u0026nbsp;cell\u003c/i\u003e\u0026gt;, where\r\n\u0026lt;\u003ci\u003estart\u0026nbsp;cell\u003c/i\u003e\u0026gt; is the coordinates of a cell where the moving checker is located before the turn, \r\nand \u0026lt;\u003ci\u003efinish\u0026nbsp;cell\u003c/i\u003e\u0026gt; is the coordinates of its destination cell. There will always be 31 turns.\u003c/div\u003e\u003c/div\u003e\u003cdiv class\u003d\"problem_par\"\u003e\u003cdiv class\u003d\"problem_par_normal\"\u003eIf it is impossible to find the necessary sequence, output the word \"Impossible\".\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\u003eD4\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003eB4-D4\r\nC6-C4\r\nA5-C5\r\n...\r\nC5-C3\r\nB3-D3\r\nD2-D4\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n\u003cbr\u003e\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\u003eD3\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003eImpossible\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n"}}]}