#include<cstdio>

#include<cstdlib>

#include<algorithm>

#include<cctype>

#include<cstring>

#include<cmath>

#define maxn 20

#define eps 1e-9

using namespace std;

double s[maxn*maxn][maxn];

double q[maxn][maxn];

double ans[maxn];

int main(){

    int n;

    scanf("%d",&n);

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

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

    int m=;

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

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

            double *c=s[++m];

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

                c[k]=*(q[i][k]-q[j][k]);

                c[n+]+=q[i][k]*q[i][k]-q[j][k]*q[j][k];

            }

        }

    //for(int i=1;i<=m;++i,printf("\n"))

    //    for(int j=1;j<=n+1;++j)    printf("%.2lf ",s[i][j]);

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

        int now=i;

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

            if(fabs(s[j][i])-fabs(s[now][i])>eps)    now=j;

        if(now^i)    swap(s[i],s[now]);

        double ret=s[i][i];

        for(int j=i;j<=n+;++j)    s[i][j]=s[i][j]/ret;

        for(int j=i+;j<=m;++j){

            ret=s[j][i];

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

        }

    }

    ans[n]=s[n][n+];

    //for(int i=1;i<=m;++i,printf("\n"))

    //    for(int j=1;j<=n+1;++j)    printf("%.2lf ",s[i][j]);

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

        ans[i]=s[i][n+];

        for(int j=i+;j<=n;++j)    ans[i]=ans[i]-ans[j]*s[i][j];

    }

    for(int i=;i<=n;++i)    printf("%.3lf ",ans[i]);

    return ;

}