#include <bits/stdc++.h> using namespace std; using ll = long long; using ld = long double; ll a[101][101]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); ll n; cin >> n; if (n == 2) { cout << "-1\n"; return 0; } ll sum = n * (n - 1) / 2; for (int i = 0; i < n - 1; ++i) a[0][i] = i + 1; a[0][n - 1] = sum; if (n & 1) { ll cur = 1; for (int i = 0; i < n; ++i) for (int j = 0; j < n; ++j) a[i][j] = cur++; } else { for (int i = 1; i < n - 1; ++i) for (int j = 0; j < n; ++j) a[i][j] = a[i - 1][j] + sum; for (int j = 0; j < n; ++j) { ll cur = 0; for (int i = 0; i < n - 1; ++i) cur += a[i][j]; if (cur % n == 0) { a[n - 1][j] = cur; continue; } ll need = n - (cur % n); cur = (cur - (cur % n)) + need; a[n - 1][j] = cur; } } //set <ll> s; //for (int i = 0; i < n; ++i) //for (int j = 0; j < n; ++j) //s.insert(a[i][j]); //if (int(s.size()) != n * n) { //cout << "-1\n"; //return 0; //} for (int i = 0; i < n; ++i, cout << "\n") for (int j = 0; j < n; ++j) cout << a[i][j] << " "; }