#include <bits/stdc++.h>
using namespace std;
using ll = long long;
void bober() {
  int n;
  cin >> n;
  vector<double> dp(1 << n, 0.0);
  vector<vector<double>> a(n, vector<double>(n));
  dp[(1 << n) - 1] = 1.0;
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) {
      cin >> a[i][j];
    }
  }
  for (int mask = (1 << n) - 1; mask >= 0; mask--) {
    if (__builtin_popcount(mask) <= 1) continue;
    for (int i = 0; i < n; i++) {
      if (!((mask >> i) & 1)) continue;
      for (int j = 0; j < n; j++) {
        if (!((mask >> j) & 1) || i == j) continue;
        double y = dp[mask] * a[i][j];
        dp[mask - (1 << j)] += y;
      }
    }
  }
  double sum = 0.0;
  for (int i = 0; i < n; i++) {
    sum += dp[1 << i];
  }
  cout << fixed << setprecision(6);
  for (int i = 0; i < n; i++) {
    dp[1 << i] /= sum;
    cout << dp[1 << i] << " ";
  }
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int q;
  q = 1;
  while (q--) {
    bober();
  }
  return 0;
}
