#include<iostream>
#include<cstdio>
#include<vector>
#define N 10000
#define mod 998244353
using namespace std;
const int inf=(int)(1e9);
int read()
{
	char c=0;
	int sum=0;
	while (c<'0'||c>'9') c=getchar();
	while ('0'<=c&&c<='9') sum=sum*10+c-'0',c=getchar();
	return sum;
}
int fast_pow(int a,int b)
{
	int res=1,mul=a;
	while (b)
	{
		if (b&1) res=1ll*res*mul%mod;
		mul=1ll*mul*mul%mod,b>>=1;
	}
	return res;
}
int MD(int x)
{
	return x>=mod?x-mod:x;
}
int MD2(int x)
{
	return x<0?x+mod:x;
}
void Adder(int &x,int d)
{
	x=x+d>=mod?x+d-mod:x+d;
	return;
}
void Adder2(int &x,int d)
{
	x=x+d<0?x+d+mod:x+d;
	return;
}
int n,f[N+1],delta[N+1],rt,minn=inf;
int main()
{
	int ds;
	vector<int>sp;
	vector<int>p;
	vector<int>st;
	n=read();
	for (int i=1;i<=n;++i) f[i]=read();
	for (int i=1;i<=n;++i)
	{
		delta[i]=f[i],sp=p;
		for (int j=0;j<p.size();++j) Adder2(delta[i],-f[i-(j+1)]*p[j]%mod);
		if (!delta[i]) continue;
		if (p.empty())
		{
			for (int j=1;j<=i;++j) p.push_back(0);
		}
		else
		{
			p.clear();
			for (int j=1;j<=i-rt-1;++j) p.push_back(0);
			ds=1ll*delta[i]*fast_pow(delta[rt],mod-2)%mod,p.push_back(ds);
			for (int j=0;j<st.size();++j) p.push_back(MD2(-1ll*st[j]*ds%mod));
			for (int j=0;j<sp.size();++j) Adder(p[j],sp[j]);
		}
		if ((int)(sp.size())-i<minn) minn=(int)(sp.size())-i,rt=i,st=sp;
	}
	printf("%d\n",p.size());
	for (int i=0;i<p.size();++i) printf("%d ",p[i]);
	puts("");
	return 0;
}