#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

const ll MOD = 1e9 + 7;

// Lũy thừa nhị phân tinh nghich dao modulo
ll powerMod(ll a, ll b) {
    ll r = 1; a %= MOD;
    while (b) {
        if (b & 1) r = r * a % MOD;
        a = a * a % MOD;
        b >>= 1;
    }
    return r;
}

int main() {
    int n; cin >> n;
    // Ma tran mo rong [A|b]
    vector<vector<ll>> a(n, vector<ll>(n + 1));
    for (int i = 0; i < n; i++)
        for (int j = 0; j <= n; j++)
            cin >> a[i][j];

    for (int col = 0; col < n; col++) {
        // Tim hang co phan tu khac 0 tai cot col
        int pivot = col;
        while (pivot < n && a[pivot][col] == 0) pivot++;
        if (pivot == n) { cout << "NO SOLUTION\n"; return 0; }

        swap(a[col], a[pivot]);

        // Chuan hoa hang pivot: chia cho a[pivot][col]
        ll inv = powerMod(a[col][col], MOD - 2);
        for (int j = col; j <= n; j++)
            a[col][j] = a[col][j] * inv % MOD;

        // Khu cot col o cac hang khac
        for (int i = 0; i < n; i++) {
            if (i != col && a[i][col] != 0) {
                ll factor = a[i][col];
                for (int j = col; j <= n; j++) {
                    a[i][j] = (a[i][j] - factor * a[col][j] % MOD + MOD) % MOD;
                }
            }
        }
    }

    // In nghiem
    for (int i = 0; i < n; i++)
        cout << a[i][n] << "\n";
    return 0;
}