#include <bits/stdc++.h>   using namespace std;   typedef pair<long long, long long> pii;   typedef vector<long long> vi;   typedef vector<pii> vpii;   typedef vector<vi> vvi;   double prob[20][20];   double dp[(1 << 19)];   double pmove(long long prev_mask, long long j, long long n) {     long long k = __builtin_popcount(prev_mask);     long long den = k * (k - 1) / 2;     double moveprob = 0;     for (long long i = (0); i < (n); i += 1) {       if ((1 << i) & prev_mask) {         moveprob += prob[i][j];       }     }     return moveprob / (1.0 * den);   }   double get_ans(long long mask, long long n) {     long long alive = __builtin_popcount(mask);     if (alive == n) return 1;     if (dp[mask] > -0.9) return dp[mask];     double ans = 0;     for (long long i = (0); i < (n); i += 1) {       if (!(mask & (1 << i))) {         long long prev_mask = mask ^ (1 << i);         ans += get_ans(prev_mask, n) * pmove(prev_mask, i, n);       }     }     return dp[mask] = ans;   }   void solve() {     long long n;     cin >> n;     memset(dp, -1, sizeof dp);     for (long long i = (0); i < (n); i += 1)       for (long long j = (0); j < (n); j += 1) cin >> prob[i][j];     for (long long i = (0); i < (n); i += 1) {       printf( %.6lf  , get_ans((1 << i), n));     }   }   int32_t main() {     ios_base::sync_with_stdio(false);     cin.tie(0);     cout.tie(0);     long long t = 1;     while (t--) {       solve();     }   }   