{"raw_statement":[{"iden":"problem statement","content":"There is an $N \\times N$ grid. The cell at the $i$\\-th row from the top and $j$\\-th column from the left is called $(i,j)$.\nFor each way of writing $0$ or $1$ in each cell, define $f(X)$ as follows:\n\n*   The number of ways to move from a cell with $X$ written on it to another cell with $X$ written on it by repeating the operation \"move to the right adjacent cell or move to the down adjacent cell\" **one or more times**.\n\nConstruct one way of writing that satisfies $f(0) = f(1)$. It is guaranteed that a solution exists under the constraints of this problem."},{"iden":"constraints","content":"*   $1 \\le N \\le 500$"},{"iden":"input","content":"The input is given from Standard Input in the following format:\n\n$N$"},{"iden":"sample input 1","content":"2"},{"iden":"sample output 1","content":"01\n01\n\nThere is one way, shown below, to perform operations satisfying the condition for $f(0)$, so $f(0) = 1$.\n\n*   Start from $(1,1)$ and move to $(2,1)$.\n\nThere is one way, shown below, to perform operations satisfying the condition for $f(1)$, so $f(1) = 1$.\n\n*   Start from $(1,2)$ and move to $(2,2)$.\n\nSince $f(0) = f(1)$, the condition is satisfied."},{"iden":"sample input 2","content":"6"},{"iden":"sample output 2","content":"100111\n101000\n100010\n011101\n010000\n110001"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}