#include <bits/stdc++.h>
using namespace std;
#define gc() (p1==p2&&(p2=(p1=buf)+fread(buf,1,100000,stdin),p1==p2)?EOF:*p1++)
char buf[100001],*p1=buf,*p2=buf;
int n , tst;
const int mod = 998244353;
long long a[550][550] , b[550][550] , coe[550];
void swap_row( int x , int y )
{
	swap(a[x] , a[y]);
}
void swap_col( int x , int y )
{
	for(int i = 1 ; i <= n ; i++ ) swap(a[i][x] , a[i][y]);
}
void trans_row( int x , int y , long long k ) 
{
	for(int i = 1 ; i <= n ; i++ ) (a[y][i] += a[x][i] * k) %= mod;
}
void trans_col( int x , int y , long long k ) 
{
	for(int i = 1 ; i <= n ; i++ ) (a[i][y] += a[i][x] * k) %= mod;
}
struct poly
{
	long long a[550]; int siz;
	poly operator * ( const poly &x ) const
	{
		poly ans; memset(ans.a , 0 , sizeof(ans.a)); ans.siz = siz + x.siz;
		for(int i = 0 ; i <= siz ; i++ )
			for(int j = 0 ; j <= x.siz ; j++ )
				(ans.a[i + j] += a[i] * x.a[j]) %= mod;
		return ans;
	}
	poly operator + ( const poly &x ) const
	{
		poly ans; memset(ans.a , 0 , sizeof(ans.a)); ans.siz = max(siz , x.siz);
		for(int i = 0 ; i <= ans.siz ; i++ ) ans.a[i] = (a[i] + x.a[i]) % mod;
		return ans;
	}
} d[550] , e0 , e1 , ef , e;
long long exp( int a , int b )
{
	long long ans = 1 , t = a;
	while(b)
	{
		if(b & 1) ans = ans * t % mod;
		t = t * t % mod; b >>= 1;
	}
	return ans;
}
inline int read()
{
    char ch=gc(); int x=0;
    while (!(ch>='0'&&ch<='9')) ch=gc();
    while (ch>='0'&&ch<='9') x=(x<<3)+(x<<1)+ch-48,ch=gc();
    return x;
}
int main()
{
//	freopen("1.in" , "r" , stdin);
//	freopen("1.out" , "w" , stdout);
	n = read();
	for(int i = 1 ; i <= n ; i++ )
		for(int j = 1 ; j <= n ; j++ ) a[i][j] = read();
	for(int i = 2 ; i <= n ; i++ )
	{
		int id = 0;
		for(int j = i ; j <= n ; j++ )
			if(a[j][i - 1]) id = j;
		if(!id) continue;
		swap_row(i , id); swap_col(i , id);
		for(int j = i + 1 ; j <= n ; j++ )
		{
			coe[j] = exp(a[i][i - 1] , mod - 2) * a[j][i - 1] % mod;
			trans_row(i , j , mod - coe[j]); trans_col(j , i , coe[j]);
		}
	}
	d[0].siz = 0; d[0].a[0] = 1; e0 = d[0]; 
	e1.siz = 1; e1.a[1] = 1;
	ef.siz = 0; ef.a[0] = mod - 1;
	for(int i = 1 ; i <= n ; i++ )
	{
		poly noww = d[0] , las = e;
		for(int j = i ; j >= 1 ; j-- )
		{
			las.siz = 0; las.a[0] = (mod - a[j][i]) % mod;
			if(i == j) las = las + e1;
			d[i] = d[i] + ((i - j) % 2 ? ef : e0) * noww * d[j - 1] * las;
//			cerr << i << ' ' << j << ' ' << d[j - 1].a[2] << ' ' << las.a[1] << endl;
			las.siz = 0; las.a[0] = (mod - a[j][j - 1]) % mod;
			noww = noww * las;
		}
	}
	for(int i = 0 ; i <= n ; i++ ) printf("%lld " , d[n].a[i]);
	return 0;
}
/*
*/