#include <vector>
#include <cstdint>
#include <iostream>
#include <algorithm>
using namespace std;

namespace myrandom {
	uint64_t seed = 1234567891234567891;
	uint64_t xorshift64() {
		seed ^= seed << 13;
		seed ^= seed >> 7;
		seed ^= seed << 17;
		return seed;
	}
	int next_int(int l, int r) {
		return l + int(xorshift64() % (r - l));
	}
}

const int INF = 1012345678;
const int D = 100'000'000;

int get_score(int N, const vector<vector<int> >& A, const vector<int>& ans) {
	vector<vector<int> > B(N);
	B[N - 1] = ans;
	for (int i = N - 2; i >= 0; i--) {
		B[i].resize(i + 1);
		for (int j = 0; j <= i; j++) {
			B[i][j] = (B[i + 1][j] + B[i + 1][j + 1]) % D;
		}
	}
	int score = -INF;
	for (int i = 0; i < N; i++) {
		for (int j = 0; j <= i; j++) {
			int d = abs(B[i][j] - A[i][j]);
			d = min(d, D - d);
			score = max(score, d);
		}
	}
	return D / 2 - score;
}

vector<int> solve(int N, const vector<vector<int> >& A) {
	const int repeats = 20000;
	int best_score = 0;
	vector<int> opt;
	for (int id = 1; id <= repeats; id++) {
		vector<vector<int> > B(N);
		for (int i = 0; i < N; i++) {
			B[i].resize(i + 1);
		}
		int error = D / 2 - best_score;
		B[N - 1][0] = (A[N - 1][0] + myrandom::next_int(-error / 2, +error / 2 + 1) + D) % D;
		bool fail = false;
		for (int i = 1; i < N; i++) {
			vector<int> v(i + 1);
			int target = 0;
			for (int j = i; j >= 0; j--) {
				if (j != i) {
					target = (target + B[(N - i) + j][j]) % D;
				}
				v[j] = (A[(N - i - 1) + j][j] - target + D) % D;
			}
			sort(v.begin(), v.end());
			v.push_back(v[0] + D);
			pair<int, int> opt = {-INF, -1};
			for (int j = 0; j <= i; j++) {
				opt = max(opt, {v[j + 1] - v[j], j});
			}
			if (opt.first / 2 < best_score) {
				fail = true;
				break;
			}
			int margin = (opt.first / 2 - best_score) / 2;
			int center = ((v[opt.second] + v[opt.second + 1]) / 2 + D / 2 + myrandom::next_int(-margin, +margin + 1) + D) % D;
			B[N - 1][i] = center;
			for (int j = i - 1; j >= 0; j--) {
				B[(N - i - 1) + j][j] = (B[(N - i) + j][j] + B[(N - i) + j][j + 1]) % D;
			}
		}
		int score = get_score(N, A, B[N - 1]);
		if (!fail) {
			cerr << id << ": " << score << endl;
			best_score = score;
			opt = B[N - 1];
		}
	}
	return opt;
}

int main() {
	int N;
	cin >> N;
	vector<vector<int> > A(N);
	for (int i = 0; i < N; i++) {
		A[i].resize(i + 1);
		for (int j = 0; j <= i; j++) {
			cin >> A[i][j];
		}
	}
	vector<int> ans = solve(N, A);
	for (int i = 0; i < N; i++) {
		if (i != 0) {
			cout << ' ';
		}
		cout << ans[i];
	}
	cout << endl;
	cerr << "score: " << get_score(N, A, ans) << endl;
	return 0;
}