#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
const int mod = 998244353;

inline void add_mod(int &a,int b){ a+=b; if(a>=mod) a-=mod;}

inline ll pw(ll a,ll b)
{
	ll res = 1;
	while(b)
	{
		if(b&1) res=res*a%mod;
		a=a*a%mod; b>>=1;
	}
	return res;
}

vector<int> Berlekamp_Massey(const vector<int> &a)
{
	int n = (int)a.size(), len = 0, d = 0, ld = 1, m = 0;
	vector<int> res(n), lst(n), tmp;
	res[0] = 1;
	for(int i=0; i<n; ++i)
	{
		++m; d = 0;
		for(int j=0; j<=len; ++j)
			d = (d + (ll)res[j] * a[i-j]) %mod;
		if(!d) continue;
		tmp = res;
		ll k = (ll)d * pw(ld, mod-2) %mod;
		for(int j=m; j<n; ++j)
			res[j] = (res[j] - lst[j-m] * k) %mod;
		if(len >= i-len+1) continue;
		len = i-len+1; lst = res; ld = d; m = 0;
	}
	res.resize(len+1); res.erase(res.begin());
	for(auto &t: res)
		add_mod(t = -t, mod);
	return res;
}

int main(void)
{
	int n;
	scanf("%d",&n);
	vector<int> a(n);
	for(auto &t: a)
		scanf("%d",&t);
	
	auto b = Berlekamp_Massey(a);
	
	printf("%d\n",(int)b.size());
	for(auto t: b)
		printf("%d ",t);
	return 0;
}