typedef double Matrix[maxn][maxn];

 void gauss(Matrix A, int n)

 {

     for(int i = ; i < n; i++)

     {

         int r = i;

         for(int j = i + ; j < n; j++)

             if(fabs(A[j][i]) > fabs(A[r][i]))r = j;

         if(r != i)for(int j = ; j <= n; j++)swap(A[r][j], A[i][j]);

         for(int k = i + ; k < n; k++)

         {

             double f = A[k][i] / A[i][i];

             for(int j = i; j <= n; j++)A[k][j] -= f * A[i][j];

         }

     }

     for(int i = n - ; i >= ; i--)

     {

         for(int j = i + ; j < n; j++)

         {

             A[i][n] -= A[j][n] * A[i][j];

         }

         A[i][n] /= A[i][i];

     }

 }

 #include<bits/stdc++.h>

 #define IOS ios::sync_with_stdio(false);//不可再使用scanf printf

 #define Max(a, b) ((a) > (b) ? (a) : (b))//禁用于函数，会超时

 #define Min(a, b) ((a) < (b) ? (a) : (b))

 #define Mem(a) memset(a, 0, sizeof(a))

 #define Dis(x, y, x1, y1) ((x - x1) * (x - x1) + (y - y1) * (y - y1))

 #define MID(l, r) ((l) + ((r) - (l)) / 2)

 #define lson ((o)<<1)

 #define rson ((o)<<1|1)

 #pragma comment(linker, "/STACK:102400000,102400000")//栈外挂

 using namespace std;

 inline int read()

 {

     int x=,f=;char ch=getchar();

     while (ch<''||ch>''){if (ch=='-') f=-;ch=getchar();}

     while (ch>=''&&ch<=''){x=x*+ch-'';ch=getchar();}

     return x*f;

 }

 typedef long long ll;

 const int maxn =  + ;

 const int mod = ;//const引用更快，宏定义也更快

 const int INF = 1e9;

 typedef double Matrix[maxn][maxn];

 double a[maxn][maxn];

 double tmp[maxn][maxn];

 void gauss(Matrix A, int n)

 {

     for(int i = ; i < n; i++)

     {

         int r = i;

         for(int j = i + ; j < n; j++)

             if(fabs(A[j][i]) > fabs(A[r][i]))r = j;

         if(r != i)for(int j = ; j <= n; j++)swap(A[r][j], A[i][j]);

         for(int k = i + ; k < n; k++)

         {

             double f = A[k][i] / A[i][i];

             for(int j = i; j <= n; j++)A[k][j] -= f * A[i][j];

         }

     }

     for(int i = n - ; i >= ; i--)

     {

         for(int j = i + ; j < n; j++)

         {

             A[i][n] -= A[j][n] * A[i][j];

         }

         A[i][n] /= A[i][i];

     }

 }

 int main()

 {

     int n;

     scanf("%d", &n);

     for(int i = ; i <= n; i++)

         for(int j = ; j < n; j++)scanf("%lf", &a[i][j]);

     for(int i = ; i <= n; i++)

     {

         for(int j = ; j < n; j++)

         {

             tmp[i - ][n] -= a[][j] * a[][j];

             tmp[i - ][n] += a[i][j] * a[i][j];

         }

         for(int j = ; j < n; j++)

             tmp[i - ][j] = 2.0 * (a[i][j] - a[][j]);

     }

     gauss(tmp, n);

     for(int i = ; i < n; i++)

     {

         if(i == )printf("%.3lf", tmp[i][n]);

         else printf(" %.3lf", tmp[i][n]);

     }

     puts("");

     return ;

 }