Score : $600$ points
For a positive integer $N$, a rooted binary tree that satisfies the following conditions is said to be a beautiful binary tree of degree $N$.
Given $N$, find the number, modulo $998244353$, of beautiful binary trees of degree $N$.
Input is given from Standard Input in the following format:
$N$
Print the answer.
1
1
The only binary tree that satisfies the condition is a tree with one vertex whose root has $1$ written on it.
2
6
The binary trees that satisfy the condition are the six trees shown below.
222
987355927
222222
675337738