const MOD: usize = 998244353;

fn main() {
    let mut n = String::new();
    std::io::stdin().read_line(&mut n).ok();
    let n: usize = n.trim().parse().unwrap();

    let minlen = n + n - 1;
    let limit = 425;
    let mut dp = vec![vec![vec![0usize; limit+1]; limit+1]; n+1];
    dp[0][0][0] = 1;
    for i in 0..n {
        let addval = if i == 0 { 0 } else { 1 };
        for j in 0..=limit {
            for k in 0..=limit {
                if dp[i][j][k] == 0 { continue; }
                if j+1 <= limit && k+1+addval <= limit {
                    dp[i+1][j+1][k+1+addval] += dp[i][j][k];
                    dp[i+1][j+1][k+1+addval] %= MOD;
                }
                if j+10 <= limit && k+1+addval <= limit {
                    dp[i+1][j+10][k+1+addval] += MOD - dp[i][j][k];
                    dp[i+1][j+10][k+1+addval] %= MOD;
                }
                if j+10 <= limit && k+2+addval <= limit {
                    dp[i+1][j+10][k+2+addval] += dp[i][j][k];
                    dp[i+1][j+10][k+2+addval] %= MOD;
                }
                if j+100 <= limit && k+2+addval <= limit {
                    dp[i+1][j+100][k+2+addval] += MOD - dp[i][j][k];
                    dp[i+1][j+100][k+2+addval] %= MOD;
                }
                if j+100 <= limit && k+3+addval <= limit {
                    dp[i+1][j+100][k+3+addval] += dp[i][j][k];
                    dp[i+1][j+100][k+3+addval] %= MOD;
                }
            }
        }
        for k in 0..=limit {
            for j in 0..limit {
                dp[i+1][j+1][k] += dp[i+1][j][k];
                dp[i+1][j+1][k] %= MOD;
            }
        }
    }
    let mut result = 0usize;
    for j in minlen..=limit {
        result += dp[n][j][j];
    }
    println!("{}", result % MOD);
}