{"problem":{"name":"Divide Grid","description":{"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)$. For each way of writing $0$ or $1$ in each cell, define $f(X)$ as follows: ","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"agc075_a"},"statements":[{"statement_type":"Markdown","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.\n\n## Constraints\n\n*   $1 \\le N \\le 500$\n\n## Input\n\nThe input is given from Standard Input in the following format:\n\n$N$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"agc075_a","tags":[],"sample_group":[["2","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."],["6","100111\n101000\n100010\n011101\n010000\n110001"]],"created_at":"2026-03-03 11:01:13"}}