#include <bits/stdc++.h>
#define all(x) x.begin(), x.end()
#define MOD 998244353ll
using namespace std;
using ll = long long;

ll powmod(ll a, ll n) {
	ll ret = 1;
	while (n) {
		if (n & 1) {
			ret *= a;
			ret %= MOD;
		}
		n >>= 1;
		a *= a;	a %= MOD;
	}
	return ret;
}


int main(void) {
	int n;	cin >> n;

	vector<ll> X1 = {}, Y1 = {}, X2 = {}, Y2 = {}, X = {}, Y = {};
	for (int i = 0; i < n; i++) {
		ll x, y, k;		cin >> x >> y >> k;
		ll x1 = (x - k) + y, y1 = (x - k) - y;
		X1.push_back(x1);	Y1.push_back(y1);
		X.push_back(x1);	Y.push_back(y1);
		ll x2 = (x + k) + y, y2 = (x + k) - y;
		X2.push_back(x2);	Y2.push_back(y2);
		X.push_back(x2);	Y.push_back(y2);
	}
	sort(all(X));	X.erase(unique(all(X)), X.end());
	sort(all(Y));	Y.erase(unique(all(Y)), Y.end());

	int h = X.size() + 10, w = Y.size() + 10;
	vector<vector<ll> > dp(h, vector<ll>(w));
	for (int i = 0; i < n; i++) {
		int x1 = lower_bound(all(X), X1[i]) - X.begin();
		int x2 = lower_bound(all(X), X2[i]) - X.begin();
		int y1 = lower_bound(all(Y), Y1[i]) - Y.begin();
		int y2 = lower_bound(all(Y), Y2[i]) - Y.begin();
		dp[x1][y1]++; dp[x2][y1]--; dp[x1][y2]--; dp[x2][y2]++;
	}
	for (int i = 0; i < h; i++) {
		for (int j = 1; j < w; j++) {
			dp[i][j] += dp[i][j - 1];
		}
	}
	for (int i = 1; i < h; i++) {
		for (int j = 0; j < w; j++) {
			dp[i][j] += dp[i - 1][j];
		}
	}

	vector<ll> ans(n + 1);
	for (int i = 0; i < X.size(); i++) {
		for (int j = 0; j < Y.size(); j++) {
			if (dp[i][j] < 1) {
				continue;
			}
			ans[dp[i][j]] += ((X[i + 1] - X[i]) % MOD) * ((Y[j + 1] - Y[j]) % MOD) % MOD;
			ans[dp[i][j]] %= MOD;
		}
	}
	ll div2 = powmod(2, MOD - 2);
	for (int i = 1; i < n + 1; i++) {
		cout << (ans[i] * div2 % MOD) << endl;
	}

	return 0;
}