#include <bits/stdc++.h>

using namespace std;

using int64 = long long;
const int mod = 998244353;

const int64 infll = (1LL << 62) - 1;
const int inf = (1 << 30) - 1;

struct IoSetup {
  IoSetup() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
    cerr << fixed << setprecision(10);
  }
} iosetup;


template< typename T1, typename T2 >
ostream &operator<<(ostream &os, const pair< T1, T2 > &p) {
  os << p.first << " " << p.second;
  return os;
}

template< typename T1, typename T2 >
istream &operator>>(istream &is, pair< T1, T2 > &p) {
  is >> p.first >> p.second;
  return is;
}

template< typename T >
ostream &operator<<(ostream &os, const vector< T > &v) {
  for(int i = 0; i < (int) v.size(); i++) {
    os << v[i] << (i + 1 != v.size() ? " " : "");
  }
  return os;
}

template< typename T >
istream &operator>>(istream &is, vector< T > &v) {
  for(T &in : v) is >> in;
  return is;
}

template< typename T1, typename T2 >
inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }

template< typename T1, typename T2 >
inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }

template< typename T = int64 >
vector< T > make_v(size_t a) {
  return vector< T >(a);
}

template< typename T, typename... Ts >
auto make_v(size_t a, Ts... ts) {
  return vector< decltype(make_v< T >(ts...)) >(a, make_v< T >(ts...));
}

template< typename T, typename V >
typename enable_if< is_class< T >::value == 0 >::type fill_v(T &t, const V &v) {
  t = v;
}

template< typename T, typename V >
typename enable_if< is_class< T >::value != 0 >::type fill_v(T &t, const V &v) {
  for(auto &e : t) fill_v(e, v);
}

int main() {
  int N;
  cin >> N;
  auto t = make_v< int >(N, N);
  for(int i = 0; i < N; i++) {
    int sub = N * i;

    vector< int > v;
    if(i & 1) {
      for(int j = 0; j < N; j++) {
        if(j < N / 2) v.emplace_back(j * 2);
        else v.emplace_back((j - N / 2) * 2 + 1);
      }
      reverse(begin(v), end(v));
    } else {
      for(int j = 0; j < N; j++) {
        if(j < N / 2) v.emplace_back(j * 2 + 1);
        else v.emplace_back((j - N / 2) * 2);
      }
    }
    for(int j = 0; j < N; j++) {
      t[i][j] = v[j] + sub;
    }
  }
  vector< int > X(N * N), Y(N * N);
  for(int i = 0; i < N; i++) {
    for(int j = 0; j < N; j++) {
      X[t[i][j]] = i;
      Y[t[i][j]] = j;
    }
  }
  auto mat = make_v< int >(N, N);
  int x = 0, y = N * N - 1;
  for(int i = 0; i < N * N; i++) {
    if(i & 1) {
      mat[X[y]][Y[y]] = i + 1;
      --y;
    } else {
      mat[X[x]][Y[x]] = i + 1;
      ++x;
    }
  }
  for(int i = 0; i < N; i++) {
    cout << mat[i] << endl;
  }
  cout << endl;
}