def solve():
    import sys
    n = int(sys.stdin.readline())
    size = 1 << n
    if n == 1:
        print(-1)
        return

    # Sample-based approach for n=2
    if n == 2:
        matrix = [
            [7, 14, 0, 8],
            [4, 12, 2, 11],
            [15, 9, 6, 1],
            [13, 10, 5, 3]
        ]
        for row in matrix:
            print(' '.join(map(str, row)))
        return

    # General approach for even n >= 2
    if n % 2 != 0:
        print(-1)
        return

    # Construct a matrix using recursive or other structured approach
    # For demonstration, this part can be filled with actual algorithm for larger n
    # The code here is a placeholder and may not work for n > 2
    # Generate the matrix for even n >= 2 (placeholder logic)
    matrix = [[0 for _ in range(size)] for _ in range(size)]
    current = 0
    for i in range(size):
        for j in range(size):
            matrix[i][j] = current
            current += 1
    print(-1)  # Adjust based on actual construction logic

if __name__ == "__main__":
    solve()