#include <iostream>
#include <vector>
#include <cmath>
#include <map>
#include <set>
#include <iomanip>
#include <queue>
#include <algorithm>
#include <numeric>
#include <deque>
#include <complex>
#include <cassert>

using namespace std;
using ll = long long;

int main(){

    int N, M;
    cin >> N;
    M = 1<<N;

    if (N == 1){
        cout << -1 << endl;
        return 0;
    }

    vector<vector<int>> a(M, vector<int>(M));

    for (int i=0; i<M; i++){
        for (int j=0; j<M/2; j++) a[i][j] += 1;
    }
    for (int i=0; i<M/2; i++){
        a[i][i] -= 1;
        a[i+M/2][i+M/2] += 1;
    }

    for (int i=0; i<M/2; i++){
        for (int j=0; j<M/2; j++){
            a[i][j+M/2] += (i*M/2+j)*2;
            a[i+M/2][j] += (i*M/2+j)*2;
            a[i][j] += M*M/2 + (i*M/2+j)*2;
            a[i+M/2][j+M/2] += M*M/2 + (i*M/2+j)*2;
        }
    }

    for (int i=0; i<M; i++){
        for (int j=0; j<M; j++) cout << a[i][j] << " ";
        cout << endl;
    }

    return 0;
}