//Gauss Eli Mod
//Code By SDFZ-czy
#include<cstdio>
#include<iostream>
#include<cstring>
#include<algorithm>
#include<cmath>
#define fo(i,j,k) for(i=j;i<=k;i++)
using namespace std;
double a[210][210],now;
int n;
const double eps=1e-8;
inline bool gauss()
{
int i,j,k,x;
fo(i,1,n)
{
k=i;
fo(x,i+1,n)
if(fabs(a[x][i])>fabs(a[k][i]))
k=x;
if((fabs(now=a[k][i]))<eps) return 0;
fo(j,1,n+1)
swap(a[i][j],a[k][j]);
fo(j,1,n+1)
a[i][j]/=now;
fo(k,1,n)
if(k!=i)
{
now=a[k][i];
fo(j,1,n+1)
a[k][j]-=a[i][j]*now;
}
}
return 1;
}
int main()
{
int i,j;
scanf("%d",&n);
fo(i,1,n)
fo(j,1,n+1)
scanf("%lf",&a[i][j]);
if(!gauss()) printf("No Solution\n");
else fo(i,1,n)
printf("%.2lf\n",a[i][n+1]);
return 0;
}