B"Iahub likes chess very much. He even invented a new chess piece named Coder. A Coder can move (and attack) one square horizontally or vertically. More precisely, if the Coder is located at position (x, xe2 x80 x89y), he can move to (or attack) positions (x xe2 x80 x89+ xe2 x80 x891, xe2 x80 x89y), (x xe2 x80 x931, xe2 x80 x89y), (x, xe2 x80 x89y xe2 x80 x89+ xe2 x80 x891) and (x, xe2 x80 x89y xe2 x80 x931). Iahub wants to know how many Coders can be placed on an n xe2 x80 x89 xc3 x97 xe2 x80 x89n chessboard, so that no Coder attacks any other Coder. The first line contains an integer n (1 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89n xe2 x80 x89 xe2 x89 xa4 xe2 x80 x891000). On the first line print an integer, the maximum number of Coders that can be placed on the chessboard. On each of the next n lines print n characters, describing the configuration of the Coders. For an empty cell print an '.', and for a Coder print a 'C'. If there are multiple correct answers, you can print any."...