AntiLeaf is a master on solving differential equations and polynomial techniques, thus he has came out the following problem for you.
There is a series of functions
Fk(x)F_k(x)Fk(x), where
kkk is a natural number, and
xxx is the independent variable. The value of
Fk(x)F_k(x)Fk(x) is defined as follows:
-
F0(x)=xF_0(x) = xF0(x)=x;
-
For any non-zero kkk, Fk(x)=(x2−1)Fk−1′(x)F_k(x) = \left( x^2 - 1 \right) F'_{k - 1}(x)Fk(x)=(x2−1)Fk−1′(x), where Fk−1′(x)F'_{k - 1}(x)Fk−1′(x) denotes the derivative of Fk−1(x)F_{k - 1}(x)Fk−1(x).
Given a non-negative integer
nnn and a non-negative integer
x0x_0x0, please calculate the value of
Fn(x0)F_{n}(x_0)Fn(x0).
Since the answer may be very large, you are required to output the answer modulo
998,244,353998,244,353998,244,353. It can be proved that the answer is always an integer.