#include <iostream>
#include <cstdio>
#include <vector>
#include <cstring>
#include <algorithm>
using namespace std;
const int N = 2e5 + 5;
const int mod = 998244353;

int n, a[N] = {0};

int f[N] = {0}, g[N] = {0};
int d[N] = {0};

void add(int &x, int y) {
	x = (x + y) % mod;
}
void sub(int &x, int y) {
	x = (x - y + mod) % mod;
} 

void slv1(int l, int r, int *dp) {
	if (l + 1 == r) {
		if (a[l] == 1)
			add(dp[l], dp[l - 1]);
		return;
	}
	int mid = (l + r) / 2;
	slv1(l, mid, dp);
	int mx = 0;
	for (int i = l - 1; i <= r; i++)	
		d[i] = 0;
	for (int i = mid - 1, j = mid; i >= l; i--) {
		mx = max(mx, a[i]);
		while (j < r && a[j] <= mx)
			j++;
		if (j - i >= mx) {
			add(d[max(i + mx - 1, mid)], dp[i - 1]);
			sub(d[j], dp[i - 1]);
		}
	}
	for (int i = mid; i < r; i++) {
		add(d[i], d[i - 1]);
		add(dp[i], d[i]);
	//	if (i == n) {
	//		printf("(%d, %d, %d) with %d\n", l, mid, r, d[i]);
	//	}
	}
	d[l - 1] = dp[l - 1];
	for (int i = l; i < mid; i++)
		d[i] = (d[i - 1] + dp[i]) % mod;
	mx = 0;
	for (int i = mid, j = mid - 1; i < r; i++) {
		mx = max(mx, a[i]);
		while (j >= l && a[j] < mx)
			j--;
		if (j < mid - 1 && i - j >= mx) {
			add(dp[i], (d[min(i - mx, mid - 2)] - (j == l - 1 ? 0 : d[j - 1]) + mod) % mod); 
		//	if (i == n)
		//		printf("2: (%d, %d, %d) with %d ??? %d...%d\n", l, mid, r, (d[min(i - mx, mid - 1)] - (j == l - 1 ? 0 : d[j - 1]) + mod) % mod, min(i - mx, mid - 1), j);
		}
	}
	slv1(mid, r, dp);
}

int sf[N] = {0}, sg[N] = {0};

void getpfx(int *arr, int *b) {
	b[0] = arr[0];
	for (int i = 1; i <= n + 1; i++)
		b[i] = (b[i - 1] + arr[i]) % mod;
}
int qf(int l, int r) {
	if (l >= r)
		return 0;
	if (l == 0)
		return sf[r - 1];
	return (sf[r - 1] - sf[l - 1] + mod) % mod;
}
int qg(int l, int r) {
	if (l >= r)
		return 0;
	if (l == 0)
		return sg[r - 1];
	return (sg[r - 1] - sg[l - 1] + mod) % mod;
}

int ans[N] = {0};

int want = 5;
bool debug = false;

void slv2(int l, int r) {
	if (l + 1 == r) {
		if (a[l] > 1) {
			add(ans[l], 1ll * f[l - 1] * g[l + 1] % mod);
			if (l == want && debug)
				cout << "specail " << f[l - 1] << " " << g[l + 1] << " " << 1ll * f[l - 1] * g[l + 1] % mod << endl; 
		}
		return;
	}
	int mid = (l + r) / 2;
	slv2(l, mid), slv2(mid, r);
	int semx = 0, mx = 0;
	for (int i = mid - 1, L = mid, R = mid; i >= l; i--) {
		semx = max(semx, a[i]);
		while (L < r && a[L] <= semx)
			L++;
		if (L == r)
			break;
		R = max(R, L + 1);
		while (R < r && a[R] <= semx)
			R++;
		//[L, R) 是当时的可转移区间
		int ll = max(L, i + semx - 1);
		int rr = min(R, i + a[L] - 1);
		add(ans[L], 1ll * f[i - 1] * qg(ll + 1, rr + 1) % mod);
		if (L == want && debug)
			printf("(%d, %d, %d), t1:ans[%d] += %lld\n",  l, mid, r, L, 1ll * f[i - 1] * qg(ll + 1, rr + 1) % mod);
	}
	semx = 0, mx = 0;
	for (int i = mid, L = mid - 1, R = mid - 1; i < r; i++) {
		semx = max(semx, a[i]);
		while (L >= l && a[L] <= semx)
			L--;
		if (L == l - 1)
			break;
		R = min(R, L - 1);
		while (R >= l && a[R] <= semx)
			R--;
		//[L, R] 是当时的可转移区间
		int ll = max(R, i - a[L] + 1);
		int rr = min(L, i - semx + 1);
		add(ans[L], 1ll * g[i + 1] * qf(ll, rr) % mod);
		if (L == want && debug)
			printf("(%d, %d, %d), t2:ans[%d] += %lld ll:%d rr:%d L:%d R:%d\n",  l, mid, r, L, 1ll * g[i + 1] * qf(ll, rr) % mod, ll, rr, L, R);
	}
	mx = 0, semx = 0;
	int pos = 0;
	bool flg = true;
	for (int i = mid - 1, j = mid; i >= l; i--) {
		if (a[i] == mx)
			flg = false;
		else if (a[i] > mx)
			flg = true, semx = mx, mx = a[i], pos = i;
		else if (a[i] > semx)
			semx = a[i];
		while (j < r && a[j] < semx)
			j++;
		int ll = max(mid, i + semx - 1);
		int rr = min(j, i + mx - 1);
		if (!flg)
			continue;
		add(ans[pos], 1ll * f[i - 1] * qg(ll + 1, rr + 1) % mod);
		if (pos == want && debug)
			printf("(%d, %d, %d), t3:ans[%d] += %lld\n",  l, mid, r, pos, 1ll * f[i - 1] * qg(ll + 1, rr + 1) % mod);
	}
	mx = 0, semx = 0;
	pos = 0;
	flg = true;
	for (int i = mid, j = mid - 1; i < r; i++) {
		if (a[i] == mx)
			flg = false;
		else if (a[i] > mx)
			flg = true, semx = mx, mx = a[i], pos = i;
		else if (a[i] > semx)
			semx = a[i];
		while (j >= l && a[j] < semx)
			j--;
		if (!flg)
			continue;
		int ll = max(j, i - mx + 1);
		int rr = min(mid - 1, i - semx + 1);
		add(ans[pos], 1ll * g[i + 1] * qf(ll, rr) % mod);
		if (pos == want && debug)
			printf("(%d, %d, %d), t4:ans[%d] += %lld ll:%d rr:%d i:%d qf:%d\n",  l, mid, r, pos, 1ll * g[i + 1] * qf(ll, rr) % mod, ll, rr, i, qf(ll, rr));
	}
}

void slv() {
	f[0] = 1;
	slv1(1, n + 1, f);
	reverse(a + 1, a + n + 1);
	g[0] = 1;
	slv1(1, n + 1, g);
	reverse(g, g + n + 2);
	reverse(a + 1, a + n + 1);
	
	if (debug) {
		cout << "f: ";
		for (int i = 0; i <= n + 1; i++)
			cout << f[i] << " ";
		cout << endl;
		cout << "g: ";
		for (int i = 0; i <= n + 1; i++)	
			cout << g[i] << " ";
		cout << endl; 
	}
	
	getpfx(f, sf), getpfx(g, sg);
	for (int i = 1; i <= n; i++)
		ans[i] = f[n];
	if (debug)
		cout << f[n] << endl;
	slv2(1, n + 1);
}

int main() {
//	freopen("c.in", "r", stdin);
//	freopen("ex_c3.in", "r", stdin);
//	freopen("c.out", "w", stdout);

	scanf("%d", &n);
	for (int i = 1; i <= n; i++)
		scanf("%d", &a[i]);
/*	for (int i = 1; i <= n; i++) {
		f[0] = 1;
		for (int j = 1; j <= n; j++)
			f[j] = 0;
		int p = a[i];
		a[i] = 1;
		slv1(1, n + 1, f);
		cout << f[n] << " ";
		a[i] = p;
	}
	return 0;*/
	slv();
	for (int i = 1; i <= n; i++) {
		printf("%d", ans[i]);	
		if (i < n)
			printf(" ");
	}
	return 0;
}
/*
12
2 4 3 1 2 1 3 3 3 1 2 2 

15
2 3 5 1 5 5 4 4 3 5 1 1 2 3 2 

40 36 52 24 24 29 26 25 25 40 24 24 24 36 37 

15
4 1 4 2 1 5 1 3 2 4 3 2 4 2 3 
53 23 23 23 23 52 23 28 24 30 28 23 31 23 50

15
1 4 2 1 2 3 4 4 4 1 5 3 3 4 5 
29 102 29 29 33 35 32 31 38 29 29 29 29 29 53

20
2 2 4 4 6 4 1 6 3 1 3 3 1 2 3 4 5 5 5 2 
149 107 161 107 145 107 107 181 139 107 128 132 107 130 158 107 107 107 158 186
*/