#include <cstdio>
#include <iostream>
#include <vector>

using namespace std;

const int N = 114514;
const long long Mod = 23333333;

long long n;
long long f[N];
long long g[N];

int main () {
    
    freopen ("get_bag.in", "r", stdin);
    freopen ("get_bag.out", "w", stdout);
    
    cin >> n;
    f[0] = 1;
    for (long long i = 1; i <= n; i++) {
        for (long long j = 1; j <= i && j * i <= n; j++) {
            long long now = i * j;
            for (int k = n; k >= now; k--) {
                g[k] = (g[k] + f[k - now]) % Mod;
            }
            
        }
        for (int i = 1; i <= n; i++) {
            f[i] = (f[i] + g[i]) % Mod;
//            cout << f[i] << ' ';
            g[i] = 0;
        }
//        cout << endl;
    }
    
    cout << f[n] << endl;
    
    return 0;
}