## https://yukicoder.me/problems/no/1348

MOD = 998244353

def main():
    N = int(input())

    # nodeの数の期待値

    x_n = 0
    p = 1
    for n in range(N):
        inv_n = pow(N - n, MOD -2, MOD)


        a = (p * inv_n) % MOD
        a *= n
        a %= MOD
        x_n += a
        x_n %= MOD

        p *= ((N - n - 1) * inv_n) % MOD
        p %= MOD
    x_n *= N
    x_n %= MOD

    x_e = 0
    p = 1
    for n in range(N - 1):
        inv_n = pow(N - n, MOD -2, MOD)

        a = (p * inv_n) % MOD
        a *= 2
        a %= MOD
        a *= n
        a %= MOD
        x_e += a
        x_e %= MOD

        p *= ((N - n - 2) * inv_n) % MOD
        p %= MOD
    x_e *= (N - 1)
    x_e %= MOD

    xxx = 1
    for i in range(1, N + 1):
        xxx *= i
        xxx %= MOD
    x_n *= xxx
    x_n %= MOD
    x_e *= xxx
    x_e %= MOD
    answer = (x_n - x_e) %MOD
    print(answer)
    





if __name__ == "__main__":
    main()