#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep2(i, x, n) for (int i = x; i <= n; i++)
#define rep3(i, x, n) for (int i = x; i >= n; i--)
#define each(e, v) for (auto &e : v)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sz(x) (int)x.size()
using ll = long long;
using pii = pair<int, int>;
using pil = pair<int, ll>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;

template <typename T>
bool chmax(T &x, const T &y) {
    return (x < y) ? (x = y, true) : false;
}

template <typename T>
bool chmin(T &x, const T &y) {
    return (x > y) ? (x = y, true) : false;
}

template <typename T>
int flg(T x, int i) {
    return (x >> i) & 1;
}

template <typename T>
void print(const vector<T> &v, T x = 0) {
    int n = v.size();
    for (int i = 0; i < n; i++) cout << v[i] + x << (i == n - 1 ? '\n' : ' ');
    if (v.empty()) cout << '\n';
}

template <typename T>
void printn(const vector<T> &v, T x = 0) {
    int n = v.size();
    for (int i = 0; i < n; i++) cout << v[i] + x << '\n';
}

template <typename T>
int lb(const vector<T> &v, T x) {
    return lower_bound(begin(v), end(v), x) - begin(v);
}

template <typename T>
int ub(const vector<T> &v, T x) {
    return upper_bound(begin(v), end(v), x) - begin(v);
}

template <typename T>
void rearrange(vector<T> &v) {
    sort(begin(v), end(v));
    v.erase(unique(begin(v), end(v)), end(v));
}

template <typename T>
vector<int> id_sort(const vector<T> &v, bool greater = false) {
    int n = v.size();
    vector<int> ret(n);
    iota(begin(ret), end(ret), 0);
    sort(begin(ret), end(ret), [&](int i, int j) { return greater ? v[i] > v[j] : v[i] < v[j]; });
    return ret;
}

template <typename S, typename T>
pair<S, T> operator+(const pair<S, T> &p, const pair<S, T> &q) {
    return make_pair(p.first + q.first, p.second + q.second);
}

template <typename S, typename T>
pair<S, T> operator-(const pair<S, T> &p, const pair<S, T> &q) {
    return make_pair(p.first - q.first, p.second - q.second);
}

template <typename S, typename T>
istream &operator>>(istream &is, pair<S, T> &p) {
    S a;
    T b;
    is >> a >> b;
    p = make_pair(a, b);
    return is;
}

template <typename S, typename T>
ostream &operator<<(ostream &os, const pair<S, T> &p) {
    return os << p.first << ' ' << p.second;
}

struct io_setup {
    io_setup() {
        ios_base::sync_with_stdio(false);
        cin.tie(NULL);
        cout << fixed << setprecision(15);
    }
} io_setup;

const int inf = (1 << 30) - 1;
const ll INF = (1LL << 60) - 1;
const int MOD = 1000000007;
// const int MOD = 998244353;

template <typename T>
T next_combination(T comb) { // comb の辞書順で次に大きい部分集合を求める
    assert(comb > 0);
    T x = comb & (-comb), y = comb + x, z = comb & (~y);
    return ((z / x) >> 1) | y;
}

int main() {
    int N;
    cin >> N;

    vector<vector<int>> v(N, vector<int>(N));
    rep(i, N) rep(j, N) cin >> v[i][j];

    vector<vector<ll>> dp(1 << N, vector<ll>(N, 0));
    rep(i, N) dp[1 << i][i] = 1;

    for (int t = 1; t < N; t <<= 1) {
        rep(i, 1 << N) {
            if (__builtin_popcount(i) != t) continue;
            vector<int> r;
            rep(j, N) {
                if (!flg(i, j)) r.eb(j);
            }
            for (int s = (1 << t) - 1; s < (1 << (N - t)); s = next_combination(s)) {
                int a = 0;
                rep(j, N - t) {
                    if (flg(s, j)) a |= 1 << r[j];
                }
                assert((i & a) == 0);
                rep(j, N) {
                    if (!flg(i, j)) continue;
                    rep(k, N) {
                        if (!flg(a, k)) continue;
                        if (v[j][k] == 1) {
                            dp[i | a][j] += dp[i][j] * dp[a][k];
                        } else {
                            dp[i | a][k] += dp[i][j] * dp[a][k];
                        }
                    }
                }
            }
        }
    }

    rep(i, N) cout << dp.back()[i] << '\n';
}