#include <bits/stdc++.h>
using namespace std;
int n;
double p[18][18], dp[1 << 18];
string binary_string(int x) {
  string ret;
  while (x) ret += '0' + (x & 1), x >>= 1;
  reverse(ret.begin(), ret.end());
  return ret;
}
int main() {
  scanf("%d", &n);
  for (int i = 0; i < n; i++)
    for (int j = 0; j < n; j++) scanf("%lf", &p[i][j]);
  dp[(1 << n) - 1] = 1;
  for (int mask = (1 << n) - 1; mask; mask--) {
    int cnt = __builtin_popcount(mask);
    for (int i = 0; i < n; i++)
      if (mask >> i & 1) {
        for (int j = 0; j < n; j++)
          if (j != i && mask >> j & 1) {
            dp[mask ^ (1 << i)] += dp[mask] * p[j][i] * 2 / (cnt * (cnt - 1));
          }
      }
  }
  for (int i = 0; i < n; i++) printf("%lf ", dp[1 << i]);
}
