#include <bits/stdc++.h>
#pragma GCC optimize "03"
using namespace std;
const long long int N = 20;
const long long int mod = 1e9 + 7;
const long long int inf = 1e9 + 9;
long double p[N][N], ans[N];
long double dp[1 << N];
signed main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long int n;
  cin >> n;
  for (long long int i = 0; i < n; i++)
    for (long long int j = 0; j < n; j++) cin >> p[i][j];
  dp[0] = 1;
  for (long long int mask = 0; mask < (1 << n); mask++) {
    long long int c = n - __builtin_popcountll(mask);
    if (c == 0) continue;
    if (c == 1) {
      for (long long int i = 0; i < n; i++)
        if (((1 << i) & mask) == 0) ans[i] = dp[mask];
      continue;
    }
    c = (c * (c - 1)) / 2;
    for (long long int i = 0; i < n; i++) {
      if ((1 << i) & mask) continue;
      for (long long int j = i + 1; j < n; j++) {
        if ((1 << j) & mask) continue;
        dp[mask + (1 << i)] += dp[mask] * p[j][i] / c;
        dp[mask + (1 << j)] += dp[mask] * p[i][j] / c;
      }
    }
  }
  for (long long int i = 0; i < n; i++)
    cout << setprecision(10) << fixed << ans[i] << " ";
  return 0;
}
