#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
using ll = long long;
using datas = pair<ll, ll>;
using ddatas = pair<long double, long double>;
using tdata = pair<ll, datas>;
using vec = vector<ll>;
using mat = vector<vec>;
using pvec = vector<datas>;
using pmat = vector<pvec>;
const ll mod = 1000000007;
const ll inf = 1LL << 60;
const long double PI = acos(-1);
const long double eps = 1e-9;
template <class T>
inline bool chmax(T& a, T b) {
  bool x = a < b;
  if (x) a = b;
  return x;
}
template <class T>
inline bool chmin(T& a, T b) {
  bool x = a > b;
  if (x) a = b;
  return x;
}
void startupcpp() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  cout << fixed << setprecision(15);
}
long double distance(ddatas x, ddatas y) {
  long double a = x.first - y.first, b = x.second - y.second;
  return sqrt(a * a + b * b);
}
ll modinv(ll a) {
  ll b = mod, u = 1, v = 0, t;
  while (b) {
    t = a / b;
    a -= t * b;
    swap(a, b);
    u -= t * v;
    swap(u, v);
  }
  return (u + mod) % mod;
}
ll moddevide(ll a, ll b) { return (a * modinv(b)) % mod; }
vec modncrlistp, modncrlistm;
ll modncr(ll n, ll r) {
  if (n < r) return 0;
  ll i, size = modncrlistp.size();
  if (size <= n) {
    modncrlistp.resize(n + 1);
    modncrlistm.resize(n + 1);
    if (!size) {
      modncrlistp[0] = modncrlistm[0] = 1;
      size++;
    }
    for (i = size; i < (ll)n + 1; i++) {
      modncrlistp[i] = modncrlistp[i - 1] * i % mod;
      modncrlistm[i] = modinv(modncrlistp[i]);
    }
  }
  return modncrlistp[n] * modncrlistm[r] % mod * modncrlistm[n - r] % mod;
}
ll modpow(ll a, ll n) {
  ll res = 1;
  while (n > 0) {
    if (n & 1) res = res * a % mod;
    a = a * a % mod;
    n >>= 1;
  }
  return res;
}
ll gcd(ll a, ll b) {
  if (!b) return a;
  return (a % b == 0) ? b : gcd(b, a % b);
}
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
ll countdigits(ll n) {
  ll ans = 0;
  while (n) {
    n /= 10;
    ans++;
  }
  return ans;
}
ll sumdigits(ll n) {
  ll ans = 0;
  while (n) {
    ans += n % 10;
    n /= 10;
  }
  return ans;
}
const vector<mat> g = {
    {{0, 5, 6, 7}, {3, 4, 9, 8}, {2, 15, 10, 13}, {1, 11, 12, 14}},
    {{0, 2, 1}, {8, 3, 6}, {4, 5, 7}}};
int main() {
  startupcpp();
  ll i, j, N, cnt = 1, K = 4;
  cin >> N;
  mat v(N, vec(N, 0));
  if (N < 3) {
    cout << -1 << "\n";
    return 0;
  }
  K -= N & 1;
  for (i = 0; i < (ll)N - K; i++) {
    if (i & 1)
      for (j = N - 1; j >= (ll)0; j--) v[i][j] = cnt++;
    else
      for (j = 0; j < (ll)N; j++) v[i][j] = cnt++;
  }
  for (j = 0; j < (ll)N - K; j++) {
    if (j & 1)
      for (i = K - 1; i >= (ll)0; i--) v[i + N - K][j] = cnt++;
    else
      for (i = 0; i < (ll)K; i++) v[i + N - K][j] = cnt++;
  }
  for (i = 0; i < (ll)K; i++)
    for (j = 0; j < (ll)K; j++) v[i + N - K][j + N - K] = cnt + g[N & 1][i][j];
  for (i = 0; i < (ll)N; i++) do {
      bool f = 0;
      for (auto outi : v[i]) {
        cout << (f ? " " : "") << outi;
        f = 1;
      }
      cout << "\n";
    } while (0);
}
