#include <bits/stdc++.h>
using namespace std;
int n;
double A[20][20], dp[1 << 19];
int val(int mask) {
  int c = 0;
  while (mask != 0) {
    if (mask & 1) c++;
    mask >>= 1;
  }
  return c;
}
int main() {
  scanf("%d", &n);
  for (int i = 0; i < n; ++i)
    for (int j = 0; j < n; ++j) cin >> A[i][j];
  dp[0] = 1;
  for (int mask = 1; mask < (1 << n); mask++) {
    int c = n - val(mask) + 1;
    for (int i = 0; i < n; ++i) {
      if (mask & (1 << i)) {
        double prob = 0;
        for (int j = 0; j < n; ++j) {
          if (!(mask & (1 << j))) {
            prob += A[j][i];
          }
        }
        dp[mask] += dp[mask ^ (1 << i)] * (prob * 2 / c / (c - 1));
      }
    }
  }
  for (int i = 0; i < n; ++i) {
    int mask = 0;
    for (int j = 0; j < n; ++j) {
      if (j != i) mask += (1 << j);
    }
    printf("%.6lf ", dp[mask]);
  }
  printf("\n");
  return 0;
}
