#include <bits/stdc++.h>
#include <atcoder/all>
using namespace atcoder;
#define rep(i, n) for (int i = 0; i < (n); ++i)

using namespace std;
using ll = long long;
using mint = modint998244353;

vector<int> x = {2, 3, 5, 7, 13, 17, 19, 31, 61, 89, 107, 127, 521, 607};

int main() {
    int n;
    cin >> n;
    
    int m = x.size();
    vector<mint> a(m);
    rep(i, m) a[i] = mint(2).pow(x[i])-1;
    
    mint ans;
    int m2 = 1<<m;
    rep(s, m2) {
        int k = 0;
        int sum = 0;
        mint now = 1;
        rep(i, m) if (s>>i&1) {
            ++k;
            sum += x[i];
            now *= a[i];
        }
        
        if (sum == n*k) {
            ans += now;
        }
    }
    
    cout << ans.val() << '\n';
    
    return 0;
}