#include<cstdio>

#include<algorithm>

#include<cstring>

#include<iostream>

#include<cmath>

#include<cctype>

#include<set>

#include<queue>

#include<vector>

#include<map>

using namespace std;

typedef long long LL;

inline int read() {

    int x=,f=;char ch=getchar();for(;!isdigit(ch);ch=getchar())if(ch=='-')f=-;

    for(;isdigit(ch);ch=getchar())x=x*+ch-'';return x*f;

}

const int mod =  ;

int a[][], b[], f[][], n;

bool vis[];

inline void add(int &x,int y) { x += y; if (x >= mod) x -= mod; }

int Calc(int x) {

    memset(b, , sizeof(b));

    a[][] = x;

    for (int i = ; i <= ; ++i)

        if ((a[i - ][] << ) <= n) a[i][] = a[i - ][] << ;

        else a[i][] = n + ;

    for (int i = ; i <= ; ++i)

        for (int j = ; j <= ; ++j)

            if (a[i][j - ] *  <= n) a[i][j] = a[i][j - ] * ;

            else a[i][j] = n + ;

    for (int i = ; i <= ; ++i)

        for (int j = ; j <= ; ++j)

            if (a[i][j] <= n) b[i] += ( << (j - )), vis[a[i][j]] = ;

    for (int i = ; i <= ; ++i)

        for (int j = ; j <= b[i]; ++j) f[i][j] = ;

    f[][] = ;

    for (int i = ; i < ; ++i)

        for (int s = ; s <= b[i]; ++s)

            if (f[i][s])

                for (int t = ; t <= b[i + ]; ++t)

                    if ((s & t) ==  && (t & (t >> )) == ) add(f[i + ][t], f[i][s]);

    return f[][];

}

int main() {

    n = read(); LL ans = ;

    for (int i = ; i <= n; ++i)

        if (!vis[i]) ans = 1ll * ans * Calc(i) % mod;

    cout << ans;

    return ;

}