#include <bits/stdc++.h>
using namespace std;
long long int powmod(long long int base, long long int pow) {
  long long int res = 1;
  while (pow) {
    if (pow % 2 != 0) res = (res * base) % 1000000007;
    base = (base * base) % 1000000007;
    pow /= 2;
  }
  return res;
}
double p[18][18];
double dp[1 << 18];
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int n;
  cin >> n;
  for (long long int i = 0; i < n; i++)
    for (long long int j = 0; j < n; j++) cin >> p[i][j];
  dp[0] = 1;
  for (int mask = 0; mask < (1 << n); mask++) {
    for (int j = 0; j < n; j++) {
      if (!(mask & (1 << j))) continue;
      int cnt = 0;
      double sump = 0;
      for (int k = 0; k < n; k++) {
        if (mask & (1 << k)) continue;
        cnt++;
        sump += (p[k][j]);
      }
      dp[mask] +=
          (1.0 * (sump + sump)) / (cnt * (cnt + 1)) * dp[mask xor (1 << j)];
    }
  }
  for (int k = 0; k < n; k++) printf("%.7f ", dp[(1 << k) xor ((1 << n) - 1)]);
}
