// Program 3: Matrix Product with Its Transpose

import java.util.*;
class MatrixTransposeProduct {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int m = sc.nextInt();
        if (m < 1 || m > 10) {
            System.out.println("Invalid order");
            return;
        }
        int[][] a = new int[m][m];
        int[][] product = new int[m][m];
        for (int i = 0; i < m; i++) {
            for (int j = 0; j < m; j++) {
                a[i][j] = sc.nextInt();
            }
        }
        // A-transpose[k][j] equals A[j][k].
        for (int i = 0; i < m; i++) {
            for (int j = 0; j < m; j++) {
                for (int k = 0; k < m; k++) {
                    product[i][j] += a[i][k] * a[j][k];
                }
            }
        }
        for (int i = 0; i < m; i++) {
            for (int j = 0; j < m; j++) {
                System.out.print(product[i][j] + " ");
            }
            System.out.println();
        }
    }
}