#include <cassert>
#include <cmath>
#include <algorithm>
#include <iostream>
#include <iomanip>
#include <climits>
#include <map>
#include <queue>
#include <set>
#include <cstring>
#include <vector>

using namespace std;
typedef long long ll;

ll MOD = 998244353;

int main() {
  int N;
  cin >> N;

  int L = 2 * N - 1;
  ll dp[N + 1][L + 1];
  memset(dp, 0, sizeof(dp));
  dp[0][0] = 1;
  ll C[L + 10];
  memset(C, 0, sizeof(C));
  int len = 0;
  int base = 10;
  int v = 1;

  while (v - len <= L) {
    C[v - len]++;
    ++v;

    if (v % base == 0) {
      len++;
      base *= 10;
    }
  }

  for (int i = 0; i < N; ++i) {
    for (int j = 0; j <= L; ++j) {
      for (int k = 1; k <= L; ++k) {
        int nj = j + k;
        if (nj > L) continue;

        dp[i + 1][nj] += dp[i][j] * C[k];
        dp[i + 1][nj] %= MOD;
      }
    }
  }

  cout << dp[N][L] << endl;

  return 0;
}