{"raw_statement":[{"iden":"problem statement","content":"Diverta City is a new city consisting of $N$ towns numbered $1, 2, ..., N$.\nThe mayor Ringo is planning to connect every pair of two different towns with a bidirectional road. The length of each road is undecided.\nA _Hamiltonian path_ is a path that starts at one of the towns and visits each of the other towns exactly once. The reversal of a Hamiltonian path is considered the same as the original Hamiltonian path.\nThere are $N! / 2$ Hamiltonian paths. Ringo wants all these paths to have distinct total lengths (the sum of the lengths of the roads on a path), to make the city diverse.\nFind one such set of the lengths of the roads, under the following conditions:\n\n*   The length of each road must be a positive integer.\n*   The maximum total length of a Hamiltonian path must be at most $10^{11}$."},{"iden":"constraints","content":"*   $N$ is a integer between $2$ and $10$ (inclusive)."},{"iden":"input","content":"Input is given from Standard Input in the following format:\n\n$N$"},{"iden":"sample input 1","content":"3"},{"iden":"sample output 1","content":"0 6 15\n6 0 21\n15 21 0\n\nThere are three Hamiltonian paths. The total lengths of these paths are as follows:\n\n*   $1 → 2 → 3$: The total length is $6 + 21 = 27$.\n*   $1 → 3 → 2$: The total length is $15 + 21 = 36$.\n*   $2 → 1 → 3$: The total length is $6 + 15 = 21$.\n\nThey are distinct, so the objective is met."},{"iden":"sample input 2","content":"4"},{"iden":"sample output 2","content":"0 111 157 193\n111 0 224 239\n157 224 0 258\n193 239 258 0\n\nThere are $12$ Hamiltonian paths, with distinct total lengths."}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}