#include <bits/stdc++.h>
using namespace std;
const int N = 20, inf = 1e9 + 7, mxm = 1e6 + 5;
int n;
double a[N][N];
long double dp[mxm];
int main() {
  cin >> n;
  for (int i = 0; i < n; i++)
    for (int j = 0; j < n; j++) cin >> a[i][j];
  dp[(1 << n) - 1] = 1;
  for (int i = (1 << n) - 2; i >= 0; i--)
    for (int j = 0; j < n; j++)
      for (int k = 0; k < n; k++)
        if (((1 << j) & i) && !((1 << k) & i) && k != j)
          dp[i] += dp[i | (1 << k)] * a[j][k] /
                   (__builtin_popcount(i) * (__builtin_popcount(i) + 1) / 2);
  for (int i = 0; i < n; i++)
    cout << fixed << setprecision(7) << dp[(1 << i)] << " ";
  return 0;
}
