#include<bits/stdc++.h>
#define L(i, j, k) for(int i = (j); i <= (k); ++i)
#define R(i, j, k) for(int i = (j); i >= (k); --i)
#define ll long long 
#define vi vector < int > 
#define sz(a) ((int) (a).size())
#define ll long long 
#define ull unsigned long long
#define me(a, x) memset(a, x, sizeof(a)) 
using namespace std;
const int N = 1e6 + 7, mod = 998244353;
inline int qpow(int x, int y = mod - 2) {
	int ret = 1;
	for(; y; x = (ll) x * x % mod, y >>= 1) if(y & 1) ret = (ll) ret * x % mod;
	return ret;
}
int n, a[N];
int main() {
	ios :: sync_with_stdio(false);
	cin.tie(0); cout.tie(0);
	cin >> n;
	L(i, 1, n) {
		cin >> a[i];
	}
	vi ns = vi{1};
	vi lst;
	int lsp = 0, lsv = 0;
	L(i, 1, n) if(sz(ns) <= i) {
		int s = 0;
		L(j, 0, sz(ns) - 1) 
			(s += (ll) a[i - j] * ns[j] % mod) %= mod;
		if(!s) continue;
		auto cur = ns;
		if(lsp) {
			int buf = (ll) (mod - s) * qpow(lsv) % mod;
			if(sz(ns) < sz(lst) + i - lsp) ns.resize(sz(lst) + i - lsp);
			L(j, 0, sz(lst) - 1) {
				(ns[j + i - lsp] += (ll) lst[j] * buf % mod) %= mod;
			}
		} 
		if(!sz(lst) || sz(cur) - i < sz(lst) - lsp) {
			lsp = i;
			lsv = s;
			lst = cur;
		}
	}
	cout << sz(ns) - 1 << '\n';
	L(i, 1, sz(ns) - 1) 
		cout << (mod - ns[i]) % mod << ' ';
//	L(i, sz(ns), n) {
//		int r = 0;
//		L(j, 0, sz(ns) - 1) {
//			(r += (ll)ns[j] * a[i - j] % mod) %= mod;
//		}
//		cout << r << endl;
//	}
	return 0;
}