eolymp

Half

Time limit 1 second
Memory limit 128 MiB

Write a program that fills array n × n with the next way: secondary diagonal contains zeros, all cells above it contains twos and all cells below it contains ones.

Input data

One integer n (n20).

Output data

Print the array filled like described above.

Examples

Input example #1
3
Output example #1
220
201
011