#include <cmath>

#include <cstdio>

#include <iostream>

#define N 21

using namespace std;

int n;

double a[N][N];

inline void gs()

{

	int i, j, k;

	double div;

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

	{

		k = j;

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

			if(fabs(a[i][j]) > fabs(a[k][j])) k = i;

		if(k != j) swap(a[k], a[j]);

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

		{

			div = a[i][j] / a[j][j];

			for(k = j; k <= n + 1; k++)

				a[i][k] -= a[j][k] * div;

		}

	}

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

	{

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

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

		a[i][n + 1] /= a[i][i];

	}

}

int main()

{

	int i, j;

	scanf("%d", &n);

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

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

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

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

		{

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

			a[i][j] = -2 * a[i][j] + 2 * a[n + 1][j];

		}

	gs();

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

	return 0;

}