#include <bits/stdc++.h>
using namespace std;
double arr[20][20];
double dp[300005];
int pw[20];
int n;
void pre() {
  pw[0] = 1;
  for (int i = 1; i <= 18; ++i) {
    pw[i] = (pw[i - 1] << 1);
  }
}
bool bit(int x, int ps) { return x & pw[ps]; }
void solve() {
  scanf("%d", &n);
  for (int i = 0; i < n; ++i) {
    for (int j = 0; j < n; ++j) {
      scanf("%lf", &arr[i][j]);
    }
  }
  dp[pw[n] - 1] = 1.0;
  for (int m = pw[n] - 1; m > 0; --m) {
    int cnt = __builtin_popcount(m);
    double mlt = 2.0 / (cnt * (cnt - 1));
    for (int i = 0; i < n; ++i) {
      if (!bit(m, i)) {
        continue;
      }
      for (int j = 0; j < n; ++j) {
        if (i == j) {
          continue;
        }
        if (!bit(m, j)) {
          continue;
        }
        dp[m - pw[j]] += dp[m] * mlt * arr[i][j];
      }
    }
  }
  for (int i = 0; i < n; ++i) {
    printf("%.10f ", dp[pw[i]]);
  }
}
int main() {
  int tt = 1;
  pre();
  while (tt--) {
    solve();
  }
  return 0;
}
