{"raw_statement":[{"iden":"problem statement","content":"We have a grid board with $N$ rows and $N$ columns.\nPaint every square black or white to satisfy all of the conditions below.\n\n*   For each row, exactly three of the squares in that row are painted black.\n*   For each column, exactly three of the squares in that column are painted black.\n*   There are exactly $N$ connected components of black squares. Here, two black squares $x$ and $y$ are considered connected when it is possible to start at $x$ and reach $y$ by repeatedly moving up, down, left, or right to a black square.\n\nIt can be proved that the Constraints of the problem guarantee the existence of a solution."},{"iden":"constraints","content":"*   $6 \\leq N \\leq 500$\n*   All values in input are integers."},{"iden":"input","content":"Input is given from Standard Input in the following format:\n\n$N$"},{"iden":"sample input 1","content":"6"},{"iden":"sample output 1","content":"##..#.\n##..#.\n..##.#\n..##.#\n##...#\n..###.\n\nHere, there are exactly $3$ `#`s in each row and column. Additionally, there are exactly $6$ connected components of `#`s."}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}