#include <bits/stdc++.h>
const int N = (1 << 19) - 1;
using namespace std;
int n;
double dp[N + 1], a[20][20];
int main() {
  scanf("%d", &n);
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) scanf("%lf", &a[i][j]);
  }
  dp[(1 << n) - 1] = 1;
  for (int s = ((1 << n) - 1); s > 0; s--) {
    int c = 0;
    for (int i = 0; i < n; i++) {
      if ((1 << i) & s) c++;
    }
    if (c < 2) continue;
    for (int i = 0; i < n; i++)
      if ((1 << i) & (s))
        for (int j = 0; j < n; j++) {
          if (i == j) continue;
          if ((1 << j) & s) {
            dp[s ^ (1 << i)] += dp[s] * a[j][i] / c / (c - 1);
            dp[s ^ (1 << j)] += dp[s] * a[i][j] / c / (c - 1);
          }
        }
  }
  for (int i = 1; i < (1 << n); i <<= 1) {
    printf("%.10f ", dp[i]);
  }
}
