#include <bits/stdc++.h>
using namespace std;
const int inf = (int)1e9;
const long long llinf = (long long)3e18;
const int N = (int)1e5 + 111;
const long double PI = (long double)acos(-1);
int n, cnt;
long double a[20][20], dp[(1 << 20)];
int cnt_bits(int mask) {
  int res = 0;
  for (int i = 0; i < 18; i++)
    if ((mask >> i) % 2 == 1) res++;
  return res;
}
int main() {
  cin >> n;
  cout << fixed << setprecision(8);
  for (int i = 0; i < n; i++)
    for (int j = 0; j < n; j++) cin >> a[i][j];
  for (int i = 0; i < (1 << n) - 1; i++) dp[i] = (long double)0;
  dp[(1 << n) - 1] = (long double)1;
  for (int mask = (1 << n) - 1; mask > 0; mask--) {
    cnt = cnt_bits(mask);
    if (cnt == 1)
      continue;
    else
      for (int i1 = 0; i1 < n; i1++)
        for (int i2 = i1 + 1; i2 < n; i2++)
          if ((mask >> i1) % 2 == 1 && (mask >> i2) % 2 == 1) {
            dp[mask - (1 << i2)] += dp[mask] * a[i1][i2] * (long double)1 /
                                    (long double)(cnt * (cnt - 1) / 2);
            dp[mask - (1 << i1)] += dp[mask] * a[i2][i1] * (long double)1 /
                                    (long double)(cnt * (cnt - 1) / 2);
          }
  }
  for (int i = 0; i < n; i++) cout << dp[(1 << i)] << " ";
  return 0;
}
