#include <bits/stdc++.h>
using namespace std;
inline void setmin(int &x, int y) {
  if (y < x) x = y;
}
inline void setmax(int &x, int y) {
  if (y > x) x = y;
}
inline void setmin(long long &x, long long y) {
  if (y < x) x = y;
}
inline void setmax(long long &x, long long y) {
  if (y > x) x = y;
}
const int N = 100000;
const int inf = (int)1e9 + 1;
const long long big = (long long)1e18 + 1;
const int P = 239;
const int MOD = (int)1e9 + 7;
const int MOD1 = (int)1e9 + 9;
const double eps = 1e-9;
const double pi = atan2(0, -1);
const int ABC = 26;
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.precision(20);
  cout << fixed;
  int n;
  cin >> n;
  long double a[n][n];
  for (int i = 0; i < n; i++)
    for (int j = 0; j < n; j++) cin >> a[i][j];
  long double dp[1 << n];
  for (int mask = 0; mask < (1 << n); mask++) dp[mask] = 0;
  dp[(1 << n) - 1] = 1;
  for (int mask = (1 << n) - 1; mask > -1; mask--) {
    int cnt = __builtin_popcount(mask);
    if (cnt <= 1) continue;
    cnt = cnt * (cnt - 1) / 2;
    for (int i = 0; i < n; i++)
      if ((mask >> i) & 1)
        for (int j = i + 1; j < n; j++)
          if ((mask >> j) & 1) {
            dp[mask ^ (1 << j)] += dp[mask] / cnt * a[i][j];
            dp[mask ^ (1 << i)] += dp[mask] / cnt * a[j][i];
          }
  }
  for (int i = 0; i < n; i++) cout << dp[(1 << i)] << " ";
  cout << "\n";
  return 0;
}
