#include <bits/stdc++.h>
using namespace std;
const int MAXN = 18;
int n;
double p[1 << MAXN];
double a[MAXN][MAXN];
double solve(int mask) {
  if (p[mask] == -1) {
    double bc = __builtin_popcount(mask);
    p[mask] = 0;
    for (int i = 0; i < n; ++i) {
      if (mask & (1 << i)) {
        for (int j = 0; j < n; ++j) {
          if (!(mask & (1 << j))) {
            p[mask] += solve(mask | (1 << j)) * a[i][j] / bc / (bc + 1) * 2;
          }
        }
      }
    }
  }
  return p[mask];
}
int main() {
  for (int i = 0; i < (1 << MAXN); ++i) p[i] = -1;
  scanf("%d", &n);
  p[(1 << n) - 1] = 1.0;
  for (int i = 0; i < n; ++i) {
    for (int j = 0; j < n; ++j) {
      scanf("%lf", &a[i][j]);
    }
  }
  for (int i = 0; i < n; ++i) {
    printf("%.6f ", solve(1 << i));
  }
}
