cf194 div2 A. Candy Bags

A. Candy Bags

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Gerald has n younger brothers and their number happens to be even. One day he bought n2 candy bags. One bag has one candy, one bag has two candies, one bag has three candies and so on. In fact, for each integer k from 1 to n2 he has exactly one bag with kcandies.

Help him give n bags of candies to each brother so that all brothers got the same number of candies.

Input

The single line contains a single integer n (n is even, 2 ≤ n ≤ 100) — the number of Gerald's brothers.

Output

Let's assume that Gerald indexes his brothers with numbers from 1 to n. You need to print n lines, on the i-th line print n integers — the numbers of candies in the bags for the i-th brother. Naturally, all these numbers should be distinct and be within limits from 1 to n2. You can print the numbers in the lines in any order.

It is guaranteed that the solution exists at the given limits.

Sample test(s)

input

2

output

1 4
2 3

笔者非常的愚蠢，每做一次都被虐一次，貌似已经快没羞耻心了，每次感觉大家在刷cf的时候，自己就像个看客一样，因为啥都不会，所以专门开了这个专题，大牛就不要看了，全是白痴题，这算是我给自己的一点提醒吧，专题开了n天，一题都还没往里面写，希望这算是一个好的开端吧。

下面是代码：

#include <cstdio>
#include <algorithm>


using namespace std;

int N, n;

int main() {
    scanf ("%d", &N);
    n = N*N;
    for (int i = 0; i < N; i++) {
        for (int p = 1; p <= N/2; p++) {
            printf ("%d %d ", i*(N/2)+p, n-(i*(N/2)+p)+1);
        }
        printf ("\n");
    }
    return 0;
}