B'Let n be an integer. Consider all permutations on integers 1 to n in lexicographic order, and concatenate them into one big sequence P . For example, if n = 3 , then P = [1, 2, 3, 1, 3, 2, 2, 1, 3, 2, 3, 1, 3, 1, 2, 3, 2, 1] . The length of this sequence is n cdot n! . Let 1 <= q i <= q j <= q n cdot n! be a pair of indices. We call the sequence (P_i, P_{i+1}, ... , P_{j-1}, P_j) a subarray of P . You are given n . Find the number of distinct subarrays of P . Since this number may be large, output it modulo 998244353 (a prime number). The only line contains one integer n ( 1 <= q n <= q 10^6 ), as described in the problem statement. Output a single integer -- the number of distinct subarrays, modulo 998244353 . In the first example, the sequence P = [1, 2, 2, 1] . It has eight distinct subarrays: [1] , [2] , [1, 2] , [2, 1] , [2, 2] , [1, 2, 2] , [2, 2, 1] and [1, 2, 2, 1] . '...