#include <bits/stdc++.h>
using namespace std;
const double eps = 1e-9;
const double PI = acos(-1.0);
const long long int mod = 1e9 + 7;
const int MAXN = 18;
int n;
double prob[MAXN + 2][MAXN + 2];
double dp[1 << MAXN];
void cp() {
  cin >> n;
  for (int i = 0; i < n; i++)
    for (int j = 0; j < n; j++) cin >> prob[i][j];
  dp[0] = 1;
  for (int mask = 0; mask < 1 << n; mask++) {
    double cnt = __builtin_popcount(mask);
    cnt = n - cnt;
    double total_match = cnt * (cnt - 1) / 2;
    for (int j = 0; j < n; j++) {
      for (int k = j + 1; k < n; k++) {
        if (!((mask >> j) & 1) && !((mask >> k) & 1)) {
          dp[mask | (1 << j)] += dp[mask] * prob[k][j] / total_match;
          dp[mask | (1 << k)] += dp[mask] * prob[j][k] / total_match;
        }
      }
    }
  }
  for (int i = 0; i < n; i++) cout << dp[((1 << n) - 1) ^ (1 << i)] << " ";
  cout << '\n';
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  ;
  int t;
  t = 1;
  cout << setprecision(10) << fixed;
  ;
  while (t--) {
    cp();
  }
  return 0;
}
