#include <bits/stdc++.h>
using namespace std;
double dp[1 << 18];
double G[18][18];
int main() {
  int n;
  cin >> n;
  for (int i = 0; i < n; i++)
    for (int j = 0; j < n; j++) cin >> G[i][j];
  dp[(1 << n) - 1] = 1;
  for (int mask = (1 << n) - 1; mask > 0; --mask) {
    int c = __builtin_popcount(mask);
    for (int i = 0; i < n; i++)
      if (mask & 1 << i) {
        for (int j = 0; j < n; j++)
          if ((j != i) && (mask & 1 << j)) {
            dp[mask ^ (1 << i)] += dp[mask] * G[j][i] * 2.0 / c / (c - 1);
          }
      }
  }
  for (int i = 0; i < n; i++) cout << dp[1 << i] << " ";
  cout << endl;
  return 0;
}
