#include <bits/stdc++.h>
using namespace std;
void solve() {
  int n;
  cin >> n;
  vector<long double> dp(1 << n, 0);
  vector<vector<long double>> p(n, vector<long double>(n, 0));
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) {
      cin >> p[i][j];
    }
  }
  dp[(1 << n) - 1] = 1;
  for (int mask = (1 << n) - 1; mask >= 1; mask--) {
    int cnt = __builtin_popcount(mask);
    if (cnt <= 1) continue;
    long double denom = cnt * (cnt - 1) / 2;
    vector<int> sb;
    for (int i = 0; i < n; i++)
      if (mask & 1 << i) sb.push_back(i);
    for (int x : sb) {
      for (int y : sb) {
        if (x == y) continue;
        dp[mask ^ 1 << x] += dp[mask] * p[y][x] / denom;
      }
    }
  }
  for (int i = 0; i < n; i++) cout << dp[1 << i] << " \n"[i == n - 1];
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  ;
  cout << fixed << setprecision(20);
  ;
  int t = 1;
  for (int i = 1; i <= t; i++) {
    solve();
  }
}
