#include <bits/stdc++.h>
using namespace std;
string to_string(string s) { return '"' + s + '"'; }
string to_string(const char* s) { return to_string((string)s); }
string to_string(bool b) { return (b ? "true" : "false"); }
template <typename A, typename B>
string to_string(pair<A, B> p) {
  return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
template <typename A>
string to_string(A v) {
  bool first = true;
  string res = "{";
  for (const auto& x : v) {
    if (!first) {
      res += ", ";
    }
    first = false;
    res += to_string(x);
  }
  res += "}";
  return res;
}
void debug_out() { cerr << '\n'; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
  cerr << " " << to_string(H);
  debug_out(T...);
}
double x[20][20];
void solve() {
  int n;
  cin >> n;
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) {
      cin >> x[i][j];
    }
  }
  vector<long double> prob(1 << n);
  prob.back() = 1;
  for (int i = (1 << n) - 1; i > 0; i--) {
    int cnt = __builtin_popcount(i);
    if (cnt == 1) continue;
    for (int j = 0; j < n; j++) {
      if ((i & (1 << j)) == 0) continue;
      for (int k = 0; k < n; k++) {
        if ((i & (1 << k)) == 0 or j == k) continue;
        prob[i & (~(1 << j))] += prob[i] / (cnt * (cnt - 1) / 2) * x[k][j];
      }
    }
  }
  for (int i = 0; i < n; i++) {
    cout << fixed << setprecision(10) << prob[1 << i] << " ";
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int t = 1;
  while (t--) {
    solve();
  }
  return 0;
}
