#include using namespace std; const long long MOD = 998244353; int main(){ int n; cin >> n; vector> dp(n + 1, vector(n * 4 + 10, 0)); dp[0][n * 2] = 1; for (int i = 0; i < n; i++){ for (int j = 0; j < n * 4 + 10; j++){ if (dp[i][j] > 0){ int j2 = j - 1; for (int k = 1; k <= n + 10; k++){ if (k == 10 || k == 100){ j2--; } if (j2 < n * 4 + 10){ dp[i + 1][j2] += dp[i][j]; dp[i + 1][j2] %= MOD; } j2++; } } } } cout << dp[n][n * 2 - 1] << endl; }