#include<iostream>
#include<algorithm>
using namespace std;
const int mod=998244353;
inline int qpow(int a,int b)
{
	int ret=1;
	while(b)
	{
		if(b&1)
		{
			ret=(long long)
			ret*a%mod;
		}
		a=(long long)
		a*a%mod,b>>=1;
	}
	return ret;
}
int n;
struct point
{
	int x,y,z;
};
inline bool operator <(const point &a,const point &b)
{
	return a.x==b.x?a.y<b.y:a.x>b.x;
}
point a[2010];
struct frac
{
	int a,b,x,y,z;
};
inline bool operator <(const frac &a,const frac &b)
{
	return (long long)a.a*b.b<(long long)b.a*a.b;
}
int num=0,p[2010];
frac f[2000010];
int sx[2010],sy[2010];
long long ans[2010];
inline long long calc(int x,int y)
{
	return (long long)x*x+
	(long long)y*y+(long long)x*y;
}
int main()
{
	cin>>n;
	for(int i=1,X,Y,Z;i<=n;i++)
	{
		cin>>X>>Y>>Z;
		a[i]={Y-X,Z-Y,X-Z};
	}
	sort(a+1,a+n+1);
	for(int i=1;i<=n;i++)
	{
		for(int j=i-1;j;j--)
		{
			if(a[i].x==a[j].x)
			{
				continue;
			}
			f[++num]={a[j].y-a[i].y,
			a[i].x-a[j].x,j,i};
		}
	}
	stable_sort(f+1,f+num+1);
	for(int i=1;i<=n;i++)
	{
		p[i]=i;
		sx[i]=sx[i-1]+a[i].x;
		sy[i]=sy[i-1]+a[i].y;
	}
	for(int i=0;i<=n;i++)
	{
		ans[i]=max(ans[i],
		calc(sx[i],sy[i]));
		ans[n-i]=max(ans[n-i],
		calc(sx[n]-sx[i],sy[n]-sy[i]));
	}
	for(int i=1;i<=num;i++)
	{
		int x=f[i].z=p[f[i].x];
		sx[x]+=a[f[i].y].x-a[f[i].x].x;
		sy[x]+=a[f[i].y].y-a[f[i].x].y;
		if(i==num||f[i]<f[i+1])
		{
			for(int j=i;;j--)
			{
				if(f[j]<f[i])
				{
					break;
				}
				int x=f[j].z;
				ans[x]=max(ans[x],calc(sx[x],sy[x]));
				ans[n-x]=max(ans[n-x],calc(sx[n]-sx[x],sy[n]-sy[x]));
			}
		}
		p[f[i].x]++,p[f[i].y]--;
	}
	int p=2*qpow(9,mod-2)%mod;
	for(int i=1;i<=n;i++)
	{
		cout<<ans[i]%mod*p%mod
		*qpow(i*i,mod-2)%mod<<'\n';
	}
	return 0;
}