#include <bits/stdc++.h>
using namespace std;

using ll = long long;

int main()
{
	int N;
    cin >> N;

    assert(1 <= N && N <= 1500);

    if (N % 3 != 0)
    {
        cout << "0" << endl;
        return 0;
    }

    N /= 3;
    
    const long MOD = 998244353;

    vector<ll> c(N + 1);
    c[0] = 1;
    c[1] = 1;

    for (int i = 2; i <= N; i++)
    {
        c[i] += c[i - 1] * c[0];
        c[i] %= MOD;
        for (int j = 1; j <= i - 1; j++)
        {
            for (int k = 0; k <= j; k++)
            {
                c[i] += ((c[k] * c[j - k]) % MOD) * c[i - 1 - j];
                c[i] %= MOD;
            }
        }
    }

    cout << c[N] << endl;
}