#include <iostream>
#include <string>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <list>
#include <iterator>
#include <cassert>
#include <numeric>
#include <functional>
#include <ctime>
#include <bitset>
#pragma warning(disable:4996) 

//#define ATCODER
#ifdef ATCODER
#include <atcoder/all>
#endif

typedef long long ll;
typedef unsigned long long ull;
#define LINF  9223300000000000000
#define LINF2 1223300000000000000
#define LINF3 1000000000000
#define INF 2140000000
const long long MOD = 1000000007;
//const long long MOD = 998244353;

using namespace std;
#ifdef ATCODER
using namespace atcoder;
#endif

int a[16][16];
ll ans[16];
ll anssum;

void calc(vector<int>& v, int i0)
{
    if (v.size() == 1) {
        assert(i0 == 0);
        ans[v[0]]++;
        anssum++;
    }
    else if (i0 == v.size()) {
        vector<int> v2;
        for (int k = 0; k < i0 / 2; k++) {
            int t0 = v[k * 2], t1 = v[k * 2 + 1];
            if (a[t0][t1]) v2.push_back(t0);
            else v2.push_back(t1);            
        }
        calc(v2, 0);
    }
    else {
        int num = (int)v.size();
        int i1 = i0 + 1;
        for (int k = i1; k < num; k++) {
            swap(v[i1], v[k]);
            calc(v, i0 + 2);
            swap(v[i1], v[k]);
        }
    }
}

void solve()
{
    int n;
    scanf("%d", &n);
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            scanf("%d", &a[i][j]);
        }
    }
    vector<int> v;
    for (int i = 0; i < n; i++) {
        v.push_back(i);
    }

    calc(v, 0);

    int cnt = 0;
    ll num = 1;
    for (int k = n; k >= 1; k--) {
        num *= k;
    }
    ll n0 = num / anssum;
    for (int i = 0; i < n; i++) {
        printf("%d\n", ans[i]*n0);
    }

    return;
}

int main()
{
#if 1
    solve();
#else
    int T, t;
    scanf("%d", &T);
    for (t = 0; t < T; t++) {
        //printf("Case #%d: ", t + 1);
        solve();
    }
#endif
    return 0;
}