#include <bits/stdc++.h>
using namespace std;
const long long N = 200005, INF = 2000000000000000000;
long long power(long long a, long long b, long long p) {
  if (a == 0) return 0;
  long long res = 1;
  a %= p;
  while (b > 0) {
    if (b & 1) res = (res * a) % p;
    b >>= 1;
    a = (a * a) % p;
  }
  return res;
}
int32_t main() {
  std::ios::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  cout.precision(std::numeric_limits<double>::max_digits10);
  ;
  long long n;
  cin >> n;
  long long ar[n][n];
  for (long long i = 0; i < (n * n); i++) {
    if ((i / n) % 2 == 0) {
      ar[i % n][(i / n)] = i + 1;
    } else {
      ar[n - (i % n) - 1][(i / n)] = i + 1;
    }
  }
  for (long long i = 0; i < n; i++) {
    for (long long j = 0; j < n; j++) cout << ar[i][j] << " ";
    cout << "\n";
  }
}
