AT_fps_24_l 順列 2

You are given an integer $ N $ . Consider permutations $ p = (p_1, p_2, \dots, p_N) $ of $ (1, 2, \dots, N) $ . Count how many such permutations satisfy the following condition, and output the result modulo $ 998244353 $ . - For every integer $ i $ such that $ 1 \leq i \leq N $ , it must hold that $ p_{p_i} \neq i $ .

The input is given from standard input in the following format: > $ N $

Print the answer.

### Sample Explanation 1 The following $ 2 $ permutations $ p $ satisfy the condition: - $ (2,3,1) $ - $ (3,1,2) $ ### Constraints - $ 1 \leq N \leq 2.5 \times 10^5 $ - $ N $ is an integer