#include <bits/stdc++.h>
using namespace std;
const int maxN = 18;
const long long INF = 1e18;
const long long MOD = 1e9 + 7;
long long gcd(long long a, long long b) { return !b ? a : gcd(b, a % b); }
long long sq(long long x) { return (x * x) % MOD; }
long long modP(long long a, long long b) {
  return (!b ? 1 : (sq(modP(a, b / 2)) * (b % 2 ? a : 1)) % MOD);
}
long double a[maxN][maxN];
long double dp[(1 << maxN)];
long double binom(int x) { return (x * x - x) / 2; }
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int n;
  cin >> n;
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) {
      cin >> a[i][j];
    }
  }
  dp[(1 << n) - 1] = 1;
  for (int mask = (1 << n) - 1; mask > 0; mask--) {
    if (__builtin_popcount(mask) == 1) continue;
    for (int i = 0; i < n; i++) {
      if (mask & (1 << i)) {
        for (int j = 0; j < n; j++) {
          if (mask & (1 << j)) {
            dp[mask ^ (1 << j)] +=
                dp[mask] * a[i][j] / binom(__builtin_popcount(mask));
          }
        }
      }
    }
  }
  cout << fixed << setprecision(6);
  for (int i = 0; i < n; i++) {
    cout << dp[(1 << i)] << " ";
  }
  return 0;
}
