#include<bits/stdc++.h>
#include<atcoder/all>
#define rep(i,b) for(int i=0;i<b;i++)
#define rrep(i,b) for(int i=b-1;i>=0;i--)
#define rep1(i,b) for(int i=1;i<b;i++)
#define repx(i,x,b) for(int i=x;i<b;i++)
#define fore(i,a) for(auto i:a)
#define fore1(i,a) for(auto &i:a)
#define rng(x) (x).begin(), (x).end()
#define rrng(x) (x).rbegin(), (x).rend()
#define sz(x) ((int)(x).size())
#define pb push_back
#define fi first
#define se second

using namespace std;
using namespace atcoder;

using ll = long long;
template<typename T> using mpq = priority_queue<T, vector<T>, greater<T>>;
template<typename T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<typename T> bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
template<typename T> ll sumv(const vector<T>&a){ll res(0);for(auto&&x:a)res+=x;return res;}
bool yn(bool a) { if(a) {cout << "Yes" << endl; return 1;} else {cout << "No" << endl; return 0;}}
#define dame { cout << "No" << endl; return 0;}
#define dame1 { cout << -1 << endl; return 0;}
#define test(x) cout << "test" << x << endl;
#define deb(x,y) cout << x << " " << y << endl;
#define deb3(x,y,z) cout << x << " " << y << " " << z << endl;
#define deb4(x,y,z,x2) cout << x << " " << y << " " << z << " " << x2 << endl;
#define out cout << ans << endl;
#define outv fore(yans , ans) cout << yans << "\n";
#define show(x) cerr<<#x<<" = "<<x<<endl;
#define showv(v) {fore(vy , v) {cout << vy << " ";} cout << endl;}
#define showv2(v) fore(vy , v) cout << vy << "\n";
using pll = pair<ll,ll>;
using pil = pair<int,ll>;
using pli = pair<ll,int>;
using pii = pair<int,int>;
using tp = tuple<int ,int ,int>;
using vi = vector<int>;
using vl = vector<ll>;
using vs = vector<string>;
using vb = vector<bool>;
using vpii = vector<pii>;
using vpli = vector<pli>;
using vpll = vector<pll>;
using vpil = vector<pil>;
using vvi = vector<vector<int>>;
using vvl = vector<vector<ll>>;
using vvs = vector<vector<string>>;
using vvb = vector<vector<bool>>;
using vvpii = vector<vector<pii>>;
using vvpli = vector<vector<pli>>;
using vvpll = vector<vpll>;
using vvpil = vector<vpil>;
using mint = modint998244353;
using vm = vector<mint>;
using vvm = vector<vector<mint>>;
vector<int> dx={1,0,-1,0,1,1,-1,-1},dy={0,1,0,-1,1,-1,1,-1};
ll gcd(ll a, ll b) { return a?gcd(b%a,a):b;}
ll lcm(ll a, ll b) { return a/gcd(a,b)*b;}
const double eps = 1e-10;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;

vvi s;

vl f (vl &in,int m){

    if (m == 2){
        vl tmp(2);
        

        if (s[in[0]][in[1]] == 1) tmp[0] = 2;
        else tmp[1] = 2;

        return tmp;
    }

    int nxtm = m / 2;

    vl bitl;

    ll l = 1 << (m-1);

    rep(i,l){
        int cnt = 0;
        rep(j,m-1) if ((i >> j & 1) == 1) cnt++;

        if (cnt == nxtm - 1) bitl.pb(i);
    }

    vl ret(m);

    map<int , int> mp;

    int mm=0;

    rep(i,m) mp[in[i]] = mm++;

    fore(y , bitl){
        vl nxtin1,nxtin2;
        nxtin1.pb(in[m-1]);

        rep(j,m-1){
            if ((y >> j & 1) == 1) nxtin1.pb(in[j]);
            else nxtin2.pb(in[j]);
        }

        vl out1 = f(nxtin1 , nxtm);
        vl out2 = f(nxtin2 , nxtm);

        rep(i,nxtm){
            rep(j,nxtm){
                if (s[nxtin1[i]][nxtin2[j]] == 1){
                    ll tmp = out1[i] * out2[j];
                    ret[mp[nxtin1[i]]] += tmp;
                }else{
                    ll tmp = out1[i] * out2[j];
                    ret[mp[nxtin2[j]]] += tmp;
                }
            }
        }
    }

    rep(i,m) ret[i] *= 2;

    return ret;  
}

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

    s.resize(n,vi(n));

    rep(i,n) rep(j,n) cin>>s[i][j];

    vl v(n);

    rep(i,n) v[i] = i;

    vl ans = f(v , n);

    outv;

    return 0;
}