#include <algorithm>
#include <iostream>
#include <numeric>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
#include <limits>

#define rep(i, a, b) for (int i = int(a); i < int(b); i++)
using namespace std;
using ll = long long int;  // NOLINT
using P = pair<ll, ll>;

// clang-format off
#ifdef _DEBUG_
#define dump(...) do{ cerr << __LINE__ << ":\t" << #__VA_ARGS__ << " = "; debug_print(__VA_ARGS__); } while(false)
template<typename T, typename... Ts> void debug_print(const T &t, const Ts &...ts) { cerr << t; ((cerr << ", " << ts), ...); cerr << endl; }
#else
#define dump(...) do{ } while(false)
#endif
template<typename T> vector<T> make_v(size_t a, T b) { return vector<T>(a, b); }
template<typename... Ts> auto make_v(size_t a, Ts... ts) { return vector<decltype(make_v(ts...))>(a, make_v(ts...)); }
template<typename T> bool chmin(T &a, const T& b) { if (a > b) {a = b; return true; } return false; }
template<typename T> bool chmax(T &a, const T& b) { if (a < b) {a = b; return true; } return false; }
template<typename T, typename... Ts> void print(const T& t, const Ts&... ts) { cout << t; ((cout << ' ' << ts), ...); cout << '\n'; }
template<typename... Ts> void input(Ts&... ts) { (cin >> ... >> ts); }
template<typename T> istream &operator,(istream &in, T &t) { return in >> t; }
struct Inf { template<typename T> constexpr operator T() { return numeric_limits<T>::max() / 2; } };
// clang-format on

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int n;
    cin, n;
    auto s = make_v(n, n, 0);
    rep(i, 0, n) {
        rep(j, 0, n) {
            cin, s[i][j];
        }
    }
    vector<int> idx(n);
    iota(idx.begin(), idx.end(), 0);
    int p = 1;
    rep(i, 0, n / 2) {
        p *= 2;
    }

    vector<int> ans(n, 0);
    vector<int> lst;
    vector<bool> used(n, false);
    auto dfs = [&](auto &f) -> void {
        if (2 * lst.size() >= n) {
            vector<int> win = lst;
            while (win.size() > 1) {
                vector<int> nxt;
                for (int i = 0; i < win.size(); i += 2) {
                    int i1 = win[i], i2 = win[i + 1];
                    nxt.push_back(s[i1][i2] ? i1 : i2);
                }
                win = move(nxt);
            }
            ans[win.front()] += p;
            return;
        }
        rep(i, 0, n) {
            if (used[i]) continue;
            used[i] = true;
            rep(j, i + 1, n) {
                if (used[j]) continue;
                used[j] = true;
                lst.push_back(s[i][j] ? i : j);
                f(f);
                lst.pop_back();
                used[j] = false;
            }
            used[i] = false;
        }
    };
    dfs(dfs);

    rep(i, 0, n) {
        print(ans[i]);
    }

    return 0;
}