#include<bits/stdc++.h>

using namespace std;
using ll=long long;

const long long mod=998244353;
const long long FACSIZE=1048576;

long long power(long long a,long long b){
  long long x=1,y=a;
  while(b>0){
    if(b&1ll){
      x=(x*y)%mod;
    }
    y=(y*y)%mod;
    b>>=1;
  }
  return x%mod;
}

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

int main(){
  ll N;
  cin >> N;
  ll sz=A000043.size();
  ll res=1;
  for(ll i=1;i<(1ll<<sz);i++){
    ll sig=0;
    ll div=0;
    ll val=1;
    for(ll j=0;j<sz;j++){
      if(i&(1ll<<j)){
        sig+=A000043[j];
        div++;
        ll ce=(mod+power(2,A000043[j])-1)%mod;
        val*=ce; val%=mod;
      }
    }
    if(sig%div==0 && sig/div==N){
      res+=val; res%=mod;
    }
  }
  cout << res%mod << "\n";
  return 0;
}