#include <bits/stdc++.h>
const long long maxn = 20, modn = 1e9 + 7;
using namespace std;
long long n;
long double dp[1 << 18], a[maxn][maxn];
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  cout << setprecision(10) << fixed;
  cin >> n;
  for (long long i = 0; i < n; i++) {
    for (long long j = 0; j < n; j++) {
      cin >> a[i][j];
    }
  }
  dp[0] = 1;
  for (long long mask = 0; mask < (1 << n); mask++) {
    for (long long i = 0; i < n; i++) {
      if (!(mask & (1 << i))) {
        for (long long j = 0; j < n; j++) {
          if (!(mask & (1 << j)) && i != j) {
            dp[mask + (1 << j)] += dp[mask] * a[i][j] /
                                   (n - (__builtin_popcount(mask))) /
                                   (n - (__builtin_popcount(mask)) - 1) * 2;
          }
        }
      }
    }
  }
  for (long long i = 0; i < n; i++) {
    cout << dp[(1 << n) - 1 - (1 << i)] << " ";
  }
  return 0;
}
