#include<bits/stdc++.h>
#define Gc() getchar()
#define Me(x,y) memset(x,y,sizeof(x))
#define Mc(x,y) memcpy(x,y,sizeof(x))
#define d(x,y) ((m)*(x-1)+(y))
#define R(n) (rnd()%(n)+1)
#define Pc(x) putchar(x)
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
#define eb emplace_back
#define all(x) x.begin(),x.end()
using namespace std;using ll=long long;using db=double;using lb=long db;using ui=unsigned;using ull=unsigned long long;using pii=pair<int,int>;
const int N=2e3+5,M=N*120+5,K=1000+5,mod=998244353,Mod=mod-1;const db eps=1e-7;const int INF=1e9+7;mt19937 rnd(263082);
#define Tp template<typename T>
#define Ts template<typename T,typename... Ar>
namespace Debug{
	Tp void _debug(char* f,T t){cerr<<f<<'='<<t<<endl;}
	Ts void _debug(char* f,T x,Ar... y){while(*f!=',') cerr<<*f++;cerr<<'='<<x<<",";_debug(f+1,y...);}
	#ifdef LOCAL
	#define gdb(...) _debug((char*)#__VA_ARGS__,__VA_ARGS__)
	#else 
	#define gdb(...) void()
	#endif
}using namespace Debug;
using cp=complex<db>;
int n,m,k;
int X[N],Y[N];
cp A[N];
db deg[N];
int rk[N],p[N];
ll sumx[N],sumy[N];
ll ans[N];
ll sq(ll x){return x*x;}
void chkmax(int x){
	ans[x]=max(ans[x],sq(2*sumx[x]-sumy[x])+sq(2*sumy[x]-sumx[x])+sq(sumx[x]+sumy[x]));
}
void chkswap(int x,db ti){
	ti+=1e-9;
	if(cos(ti)*(A[p[x]].real()-A[p[x+1]].real())+sin(ti)*(A[p[x]].imag()-A[p[x+1]].imag())<eps){
		swap(p[x],p[x+1]);
		swap(rk[p[x]],rk[p[x+1]]);
		sumx[x]=sumx[x-1]+X[p[x]];
		sumy[x]=sumy[x-1]+Y[p[x]];
		chkmax(x);
		ti-=1e-9;
		if(x^1) chkswap(x-1,ti);
		if(x^n-1) chkswap(x+1,ti);
	}
}
ll mpow(ll x,int y=mod-2){ll ans=1;while(y) y&1&&(ans=ans*x%mod),y>>=1,x=x*x%mod;return ans;}
void Solve(){
	scanf("%d",&n);
	for(int i=1;i<=n;i++){
		int x,y,z;scanf("%d%d%d",&x,&y,&z);
		X[i]=y-x;Y[i]=z-x;
		A[i]=cp(sqrt(6)*X[i]-5.0/sqrt(6)*Y[i],sqrt(6-25.0/6.0)*Y[i]);
	}
	for(int i=1;i<=n;i++){
		deg[i]=atan2(A[i].imag(),A[i].real());
	}
	const db pi=acos(-1);
	vector<tuple<db,int,int> > Q;
	for(int i=1;i<=n;i++) for(int j=1;j<=n;j++) if(fabs(deg[i]-deg[j])>eps){
		db w=atan2(A[j].real()-A[i].real(),A[i].imag()-A[j].imag());
		if(w<0) w+=2*pi;
		Q.emplace_back(w,i,j);
	}
	sort(all(Q));
	iota(p+1,p+n+1,1);
	sort(p+1,p+n+1,[](int x,int y){return A[x].real()>A[y].real();});
	for(int i=1;i<=n;i++) rk[p[i]]=i;
	for(int i=1;i<=n;i++) sumx[i]=sumx[i-1]+X[p[i]],sumy[i]=sumy[i-1]+Y[p[i]],chkmax(i);
	for(auto [w,x,y]:Q){
		if(rk[x]^n) chkswap(rk[x],w);
		if(rk[x]^1) chkswap(rk[x]-1,w);
		if(rk[y]^n) chkswap(rk[y],w);
		if(rk[y]^1) chkswap(rk[y]-1,w);
		// for(int i=1;i<n;i++) chkswap(i,w);
	}
	for(int i=1;i<=n;i++) gdb(ans[i]);
	for(int i=1;i<=n;i++) printf("%lld\n",ans[i]%mod*mpow(27*i*i)%mod);
}
int main(){
	int t=1;
	// scanf("%d",&t);
	while(t--) Solve();
	cerr<<clock()*1.0/CLOCKS_PER_SEC<<'\n';
}