#include <bits/stdc++.h>
using namespace std;
int n;
double mat[20][20];
double sol[1 << 18];
int bipc[1 << 18];
void solve(int mask, double p) {
  sol[mask] += p;
  for (int L = mask; L >= 0; --L) {
    int cnt = 0;
    cnt = bipc[L];
    for (int i = 0; i < n; ++i) {
      if (~L & (1 << i)) continue;
      for (int j = 0; j < n; ++j) {
        if (~L & (1 << j)) continue;
        if (i == j) continue;
        sol[L ^ (1 << j)] += sol[L] * mat[i][j] * 2.00 / (cnt * (cnt - 1));
      }
    }
  }
}
int main() {
  for (int i = 0; i < (1 << 18); ++i) bipc[i] = __builtin_popcount(i);
  scanf("%d", &n);
  for (int i = 0; i < n; ++i)
    for (int j = 0; j < n; ++j) scanf("%lf", &mat[i][j]);
  solve((1 << n) - 1, 1);
  for (int i = 0; i < n; ++i) printf("%.6lf ", sol[1 << i]);
  return 0;
}
