#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<set>
#include<algorithm>
#include<map>
#include<vector>
#include<queue>
#include<iostream>
#include<string>
#include<cmath>
#define N 1010
#define FOR(i,a,b) for(i=(a);i<=(b);i++)
#define ROF(i,a,b) for(i=(a);i>=(b);i--)
typedef long long LL;
using namespace std;
typedef long double LD;
double x[N][N],mat[N][N],r[N];
int main()
{
  int n,i,j,k;
  scanf("%d",&n);
  FOR(i,1,n+1)FOR(j,1,n) 
  {
    double tmp;
    scanf("%lf",&tmp);
    x[i][j]=tmp;
  }
  FOR(i,2,n+1)
  {
    double tot=0;
    FOR(j,1,n) 
    {
      tot+=x[1][j]*x[1][j]-x[i][j]*x[i][j];
      mat[i-1][j]=x[1][j]-x[i][j];
    }
    mat[i-1][n+1]=tot/2;
  }
  FOR(i,1,n-1)
   FOR(j,i+1,n)
   {
     double x=-mat[j][i]/mat[i][i];
     FOR(k,i,n+1) mat[j][k]+=mat[i][k]*x;
   }
  r[n]=mat[n][n+1]/mat[n][n];
  ROF(i,n-1,1)
  {
    double tot=mat[i][n+1];
    FOR(j,i+1,n) tot-=r[j]*mat[i][j];
    r[i]=tot/mat[i][i];
  }
  FOR(i,1,n-1) printf("%.3lf ",r[i]);
  printf("%.3lf\n",r[n]);
}