|시간 제한||메모리 제한||제출||정답||맞은 사람||정답 비율|
|2 초||512 MB||10||9||8||88.889%|
Let the LIS of a permutation be the length of its longest increasing subsequence.
A permutation is good if it is possible to find two increasing subsequences of length LIS that do not share any common elements.
Given n, find the number of good permutations with n elements. As the answer may be large, you only need to find it modulo 998 244 353.
The first line of input contains one integer n (1 ≤ n ≤ 75): the number of elements.
Output one integer: the number of good permutations with n elements, modulo 998 244 353.