Problem: 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 k candies. 

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.

Examples

Input

2


Output

1 4
2 3

Note

The sample shows Gerald's actions if he has two brothers. In this case, his bags contain 1, 2, 3 and 4 candies. He can give the bags with 1 and 4 candies to one brother and the bags with 2 and 3 to the other brother.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
int lu[1000];
int m[1000][1000] = {0}, vis[1000][1000] = {0};
int n;
void search(int);
int main() {
  cin >> n;
  if (n % 2 == 0)
    for (int j = 1; j <= n; j++) {
      for (int i = 0; i < n / 2; i++) {
        cout << j + i * n << " ";
      }
      int i;
      for (i = 1; i < n / 2; i++) {
        cout << n * n - (n / 2 - i) * n - j + 1 << " ";
      }
      cout << n * n - (n / 2 - i) * n - j + 1 << endl;
    }
  int i, j;
  if (n % 2 == 1) {
    int c = 1;
    for (i = 1; i <= n; i++)
      for (j = 1; j <= n; j++) m[i][j] = c++;
    search(1);
  }
  return 0;
}
void search(int l) {
  if (l == n + 1) {
    for (int o = 1; o < n; o++) cout << lu[o] << " ";
    cout << lu << endl;
    return;
  }
  int i, j;
  for (i = 1; i <= n; i++) {
    if (!vis[l][i]) {
      if (i > 2)
        if (lu[i - 1] != i) return;
      vis[l][i] = 1;
      lu[l] = i;
      search(l + 1);
    }
  }
}