#include <iostream>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <tuple>
#include <cmath>
#include <numeric>
#include <functional>
#include <cassert>

#define debug_value(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << #x << "=" << x << endl;
#define debug(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << x << endl;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

using namespace std;
typedef long long ll;

template<typename T>
vector<vector<T>> vec2d(int n, int m, T v){
    return vector<vector<T>>(n, vector<T>(m, v));
}

template<typename T>
vector<vector<vector<T>>> vec3d(int n, int m, int k, T v){
    return vector<vector<vector<T>>>(n, vector<vector<T>>(m, vector<T>(k, v)));
}

template<typename T>
void print_vector(vector<T> v, char delimiter=' '){
    if(v.empty()) {
        cout << endl;
        return;
    }
    for(int i = 0; i+1 < v.size(); i++) cout << v[i] << delimiter;
    cout << v.back() << endl;
}

using P = pair<int, int>;

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << setprecision(10) << fixed;
    int n; cin >> n;
    auto win = vec2d(n, n, 0);
    for(int i = 0; i < n; i++){
        for(int j = 0; j < n; j++){
            cin >> win[i][j];
        }
    }
    auto dp = vec2d(1<<n, n, 0ll);
    for(int i = 0; i < n; i++){
        dp[1<<i][i] = 1;
    }
    vector<P> vp;
    vector<int> popcount(1<<n);
    for(int s = 1; s < (1<<n); s++){
        for(int i = 0; i < n; i++){
            if(s&(1<<i)) popcount[s]++;
        }
        vp.push_back(P(popcount[s], s));
    }
    sort(vp.begin(), vp.end());
    int all_bits = (1<<n)-1;
    for(auto [_, s]: vp){
        bool ok = false;
        if(popcount[s] == 1 || popcount[s] == 2 || popcount[s] == 4 || popcount[s] == 8){
            ok = true;
        }
        if(!ok) continue;
        int rem = all_bits-s;
        for(int t = rem; t >= 0; t=(t-1)&rem){
            if(popcount[t] != popcount[s]) {
                if(t == 0) break;
                continue;
            }
            for(int i = 0; i < n; i++){
                if(!(s&(1<<i))) continue;
                for(int j = 0; j < n; j++){
                    if(!(t&(1<<j))) continue;
                    int winner = win[i][j] ? i : j;
                    dp[s+t][winner] += dp[s][i]*dp[t][j];
                }
            }
            if(t == 0) break;
        }
    }
    for(int i = 0; i < n; i++){
        cout << dp[all_bits][i] << endl;
    }
}