Taco Lists

Given a positive integer $$N$$, generate $$N$$ lists based on the following procedure:

Let the base list be $$B = [1, 2, \ldots, N]$$. For each integer $$i$$ from 0 to $$N-1$$, generate a list by rotating $$B$$ to the left by $$i$$ positions. In other words, the $$i^{th}$$ list is formed as:

$$L_i = [B_{i+1}, B_{i+2}, \ldots, B_N, B_1, \ldots, B_i]$$

Print each list on a separate line with the elements separated by a single space.

inputFormat

The input consists of a single line containing an integer $$N$$.

outputFormat

Output $$N$$ lines. The $$i^{th}$$ line should contain the elements of the $$i^{th}$$ rotated list, with each element separated by a single space.

## sample

3

1 2 3
2 3 1
3 1 2

</p>