AT_agc075_a [AGC075A] Divide Grid

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: - 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**. Construct one way of writing that satisfies $ f(0) = f(1) $ . It is guaranteed that a solution exists under the constraints of this problem.

The input is given from Standard Input in the following format: > $ N $

Output $ N $ lines. The $ i $ -th line $ (1 \le i \le N) $ should contain the digits to be written in $ (i,1),(i,2),\dots,(i,N) $ in this order without spaces.

### Sample Explanation 1 There is one way, shown below, to perform operations satisfying the condition for $ f(0) $ , so $ f(0) = 1 $ . - Start from $ (1,1) $ and move to $ (2,1) $ . There is one way, shown below, to perform operations satisfying the condition for $ f(1) $ , so $ f(1) = 1 $ . - Start from $ (1,2) $ and move to $ (2,2) $ . Since $ f(0) = f(1) $ , the condition is satisfied. ### Constraints - $ 1 \le N \le 500 $