#include <bits/stdc++.h>
using namespace std;
const int N = 18;
const int M = (1 << 18) + 5;
const int mod = 1e9 + 7;
int n;
long double a[N][N], dp[M][N], mem[M][N];
long double sum(int mask, int idx) {
  auto &ret = mem[mask][idx];
  if (ret == ret) {
    return ret;
  }
  ret = 0;
  for (int i = 0; i < n; ++i) {
    if (mask & (1 << i)) {
      ret += a[i][idx];
    }
  }
  return ret;
}
long double solve(int mask, int idx) {
  if (!(mask & (1 << idx))) {
    return 0;
  }
  auto &ret = dp[mask][idx];
  if (ret == ret) {
    return ret;
  }
  int cnt = 0;
  for (int i = 0; i < n; ++i) {
    if (mask & (1 << i)) {
      ++cnt;
    }
  }
  if (cnt == 1) {
    return 1;
  }
  int all = cnt * (cnt - 1) / 2;
  ret = 0;
  for (int i = 0; i < n; ++i) {
    if (mask & (1 << i)) {
      ret += solve(mask ^ (1 << i), idx) * sum(mask ^ (1 << i), i);
    }
  }
  return ret /= all;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  memset(dp, -1, sizeof dp);
  memset(mem, -1, sizeof mem);
  cin >> n;
  for (int i = 0; i < n; ++i) {
    for (int j = 0; j < n; ++j) {
      cin >> a[i][j];
    }
  }
  cout << fixed << setprecision(6);
  for (int i = 0; i < n; ++i) {
    cout << solve((1 << n) - 1, i) << ' ';
  }
  cout << '\n';
  return 0;
}
