#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
vector <double> Gauss(vector <vector <double>> A, vector <double> ans) {
	for (int i = 0; i < A.size(); i++) {
		if (A[i][i] == 0) {
			int maxIndex = i;
			for (int j = i + 1; j < A.size(); j++) {
				if (A[maxIndex][i] < A[j][i]) {
					maxIndex = j;
				}
			}
			swap(A[i], A[maxIndex]);
		}
		for (int j = A[i].size() - 1; j >= i; j--) {
			A[i][j] /= A[i][i];
		}

		for (int k = i + 1; k < A.size(); k++) {
			for (int l = A[k].size() - 1; l >= 0; l--) {
				A[k][l] = A[k][l] - A[i][l] * A[k][i];
			}
		}
	}

	for (int i = A.size() - 1; i >= 0; i--) {
		ans[i] = A[i][A[i].size() - 1];
		for (int j = i + 1; j <  A.size(); j++) {
			ans[i] -= A[i][j] * ans[j];
		}
	}
	return ans;
}
int main() {
	int n;
	cin >> n;
	vector <vector <double>> A;
	vector <double> ans;
	A.resize(n);
	for (int i = 0; i < n; i++) {
		A[i].resize(n + 1);
	}
	for (int i = 0; i < n; i++)
		for (int j = 0; j <= n; j++) {
			double a;
			cin >> a;
			A[i][j] = a;
		}
	ans.resize(n);
	ans = Gauss(A, ans);
	for (int i = 0; i < n; i++) {
		cout << ans[i] << endl;
	}
	system("pause");
	return 0;
}