PROGRAMMING:Round trip square
The so-called "round-trip square matrix" means that for any given n, 1 to n × The integers of N are filled in to N in turn × In the square matrix of N, start from the first lattice in the upper right corner and fill it down; After pouring the bottom, move one column to the left, change the direction and fill up; After going to the top row, change the direction and fill in the left column And so on, until n × The square matrix of n is filled. This problem requires the construction of such a "round-trip running matrix".
###Input format:
Enter a positive integer n ($$1 / leqslant n / leqslant 10 $$)
###Output format:
Output n × The round-trip matrix of n. There are n numbers in each line, each number occupies 3 digits, right aligned
###Input sample 1:
Here is a set of inputs. For example:
```in
three
```
###Output sample 1:
The corresponding output is given here. For example:
```out
7 6 1
8 5 2
9 4 3
```
###Input sample 2:
Here is a set of inputs. For example:
```in
five
```
###Output sample 2:
The corresponding output is given here. For example:
```out
21 20 11 10 1
22 19 12 9 2
23 18 13 8 3
24 17 14 7 4
25 16 15 6 5
```
answer：If there is no answer, please comment
###Input format:
Enter a positive integer n ($$1 / leqslant n / leqslant 10 $$)
###Output format:
Output n × The round-trip matrix of n. There are n numbers in each line, each number occupies 3 digits, right aligned
###Input sample 1:
Here is a set of inputs. For example:
```in
three
```
###Output sample 1:
The corresponding output is given here. For example:
```out
7 6 1
8 5 2
9 4 3
```
###Input sample 2:
Here is a set of inputs. For example:
```in
five
```
###Output sample 2:
The corresponding output is given here. For example:
```out
21 20 11 10 1
22 19 12 9 2
23 18 13 8 3
24 17 14 7 4
25 16 15 6 5
```
answer：If there is no answer, please comment