求助，ln是板子，但样例没过

// Program written by Liu Zhaozhou ~~~
#include <bits/stdc++.h>

#define lowbit(x) (x & -x)

using namespace std;

inline char gc(void) {
	static char buf[100000], *p1 = buf, *p2 = buf;
	return p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, 100000, stdin), p1 == p2) ? EOF : *p1++;
}

#define gc() getchar()

template <class T> inline void read(T &x) {
	T f = 1; x = 0; static char c = gc();
	for (; !isdigit(c); c = gc()) if (c == '-') f = -f;
	for (; isdigit(c); c = gc()) x = (x << 1) + (x << 3) + (c & 15);
	x *= f;
}

inline void readstr(char *s) {
	do *s = gc(); while ((*s == ' ') || (*s == '\n') || (*s == '\r'));
	do *(++s) = gc(); while ((~*s) && (*s != ' ') && (*s != '\n') && (*s != '\r'));
	*s = 0; return;
}

inline void readch(char&x) { while (isspace(x = gc())); }

char pf[100000], *o1 = pf, *o2 = pf + 100000;
#define ot(x) (o1 == o2 ? fwrite(pf, 1, 100000, stdout), *(o1 = pf) ++= x : *o1 ++= x)
template <class T>
inline void println(T x, char c = '\n') {
	if (x < 0) ot(45), x = -x;
	static char s[15], *b; b = s;
	if (!x) *b ++= 48;
	for (; x; * b ++= x % 10 + 48, x /= 10);
	for (; b-- != s; ot(*b)); ot(c);
}

template <class T> inline void write(T x) {
	if (x < 0) x = -x, putchar('-');
	if (x > 9) write(x / 10);
	putchar(x % 10 + 48);
}

template <class T> inline void writeln(T x, char c = '\n') { write(x); putchar(c); }
template <class T> inline void chkmax(T &x, const T y) { x > y ? x = x : x = y; }
template <class T> inline void chkmin(T &x, const T y) { x < y ? x = x : x = y; }

#define Ms(arr, opt) memset(arr, opt, sizeof(arr))
#define Mp(x, y) make_pair(x, y)

typedef long long ll;
typedef pair <int, int> pii;

const int mod = 998244353;
inline int qpow(int a, int b = mod - 2) {
	int ret = 1;
	for (; b; b >>= 1, a = 1ll * a * a % mod)
		if (b & 1) ret = 1ll * ret * a % mod;
	return ret;
}

const int Maxn = 3e5 + 5;
int n, invgen, f[Maxn], fexp[Maxn], rev[Maxn];
inline void NTT(int limit, int *arr, int type) {
	for (int i = 0; i < limit; i++)
		if (i < rev[i]) swap(arr[i], arr[rev[i]]);
	for (int mid = 1; mid < limit; mid <<= 1) {
		int w0 = qpow(type == 1 ? 3 : invgen, (mod - 1) / (mid << 1));
		for (int i = 0; i < limit; i += mid << 1) { int w = 1;
			for (int j = 0; j < mid; j++, w = 1ll * w * w0 % mod) {
				int x = arr[i + j], y = 1ll * w * arr[i + j + mid] % mod;
				arr[i + j] = (x + y) % mod; arr[i + j + mid] = (x - y + mod) % mod;
			}
		}
	}
	if (type == -1) {
		int invlim = qpow(limit);
		for (int i = 0; i < limit; i++) arr[i] = 1ll * arr[i] * invlim % mod;
	}
}

inline void Inv(int length, int *a, int *b) {
	if (length == 1) { b[0] = qpow(a[0]); return; }
	Inv(length + 1 >> 1, a, b);
	int lim = 1; while (lim < length << 1) lim <<= 1;
	static int c[Maxn];
	for (int i = 0; i < lim; i++)
		rev[i] = (rev[i >> 1] >> 1) | ((i & 1) ? (lim >> 1) : 0),
		c[i] = i < length ? a[i] : 0;
	NTT(lim, b, 1); NTT(lim, c, 1);
	for (int i = 0; i < lim; i++) b[i] = 1ll * (2ll - 1ll * c[i] * b[i] % mod + mod) % mod * b[i] % mod;
	NTT(lim, b, -1); for (int i = length; i < lim; i++) b[i] = 0;
}

inline void Derivation(int length, int *a, int *b) {
	for (int i = 1; i < length; i++) b[i - 1] = 1ll * i * a[i] % mod; b[length - 1] = 0;
}

inline void Integral(int length, int *a, int *b) {
	for (int i = 1; i < length; i++) b[i] = 1ll * a[i - 1] * qpow(i) % mod; b[0] = 0;
}

inline void Getln(int length, int *a, int *b) {
	static int g[Maxn], h[Maxn];
	Derivation(length, a, g); Inv(length, a, h);
	int lim = 1; while (lim < length << 1) lim <<= 1;
	for (int i = 0; i < lim; i++)
		rev[i] = (rev[i >> 1] >> 1) | ((i & 1) ? (lim >> 1) : 0);
	NTT(lim, g, 1); NTT(lim, h, 1);
	for (int i = 0; i < lim; i++) g[i] = 1ll * g[i] * h[i] % mod;
	NTT(lim, g, -1); Integral(length, g, b);
//	for (int i = 0; i < lim; i++) std :: cout << b[i] << " \n"[i == lim - 1];
}

inline void Getexp(int length, int *a, int *b) {
	if (length == 1) return (void) (b[0] = 1);
	Getexp(length + 1 >> 1, a, b);
	static int bln[Maxn], c[Maxn]; Getln(length, b, bln);
	int lim = 1; while (lim < length << 1) lim <<= 1;
	for (int i = 0; i < lim; i++)
		rev[i] = (rev[i >> 1] >> 1) | ((i & 1) ? (lim >> 1) : 0),
		c[i] = i < length ? (a[i] + (mod - bln[i])) % mod : 0;
	c[0]++; NTT(lim, c, 1); NTT(lim, b, 1);
	for (int i = 0; i < lim; i++) b[i] = 1ll * b[i] * c[i] % mod, std :: cout << b[i] << " \n"[i == lim - 1];
	NTT(lim, b, -1); for (int i = length; i < lim; i++) b[i] = 0;
}

signed main(void) {
	read(n); invgen = qpow(3);
	for (int i = 0; i < n; i++) read(f[i]);
	Getexp(n, f, fexp);
	for (int i = 0; i < n; i++) writeln(fexp[i], " \n"[i == n - 1]);
//	fwrite(pf, 1, o1 - pf, stdout);
	return 0;
}

/**/