#include <bits/stdc++.h>
using namespace std;
#include <atcoder/modint> 
using mint = atcoder::modint998244353;

int main() {
	mint comb[9][9];
	
	for (int i = 0; i < 9; i++) for (int j = 0; j < 9; j++) comb[i][j] = 0;
	
	for (int i = 0; i < 9; i++) {
		comb[i][0] = 1;
		for (int j = 1; j <= i; j++) comb[i][j] = comb[i-1][j-1] + comb[i-1][j];
	}
	
	int N; cin >> N;
	
	vector<mint> ans(6 * N + 1);
	for (int i = 0; i <= 8; i++) {
		mint v = comb[8][i] * (i % 2 ? -1 : 1);
		if (i * (N+1) <= 6 * N) {
			ans[i * (N+1)] = v;
		}
	}
	
	for (int i = 0; i < 8; i++) {
		for (int j = 1; j <= 6 * N; j++) ans[j] += ans[j-1];
	}
	
	cout << ans.back().val() << endl;
}