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

MOD = 998244353

# ソースコードの出典URL: https://github.com/LyricalMaestro/at_coder_snippets/blob/af67863a2fe7f16cce8325bbc531f89968bfa525/src/conbination.py

class CombinationCalculator:
    """
    modを考慮したPermutation, Combinationを計算するためのクラス
    """    
    def __init__(self, size, mod):
        self.mod = mod
        self.factorial = [0] * (size + 1)
        self.factorial[0] = 1
        for i in range(1, size + 1):
            self.factorial[i] = (i * self.factorial[i - 1]) % self.mod
        
        self.inv_factorial = [0] * (size + 1)
        self.inv_factorial[size] = pow(self.factorial[size], self.mod - 2, self.mod)

        for i in reversed(range(size)):
            self.inv_factorial[i] = ((i + 1) * self.inv_factorial[i + 1]) % self.mod

    def calc_combination(self, n, r):
        if n < 0 or n < r or r < 0:
            return 0

        if r == 0 or n == r:
            return 1
        
        ans = self.inv_factorial[n - r] * self.inv_factorial[r]
        ans %= self.mod
        ans *= self.factorial[n]
        ans %= self.mod
        return ans
    
    def calc_permutation(self, n, r):
        if n < 0 or n < r:
            return 0

        ans = self.inv_factorial[n - r]
        ans *= self.factorial[n]
        ans %= self.mod
        return ans
        

def main():
    N = int(input())
    if N == 1:
        print(1)
        return
    elif N == 2:
        print(2)
        return

    dp = [[0] * (N + 1) for _ in range(N)]
    for i in range(N):
        if i <= 1:
            dp[i][1] += 1
            dp[i][1] %= MOD

        for k in range(2, N + 1):
            if i - 2 >= 0:
                dp[i][k] += dp[i - 2][k - 1]
                dp[i][k] %= MOD

            if i - 3 >= 0:
                dp[i][k] += dp[i - 3][k - 1]
                dp[i][k] %= MOD

    combi = CombinationCalculator(N, MOD)
    answer = 0
    for i in range(N - 2, N):
        for k in range(N + 1):
            a = dp[i][k]
            a *= combi.factorial[k]
            a %= MOD
            a *= combi.factorial[N - k]
            a %= MOD
            answer += a
            answer %= MOD
    print(answer)









if __name__ == "__main__":
    main()