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

using ll = long long;

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

    assert(1 <= N && N <= 2000);
    
    const int OPEN = 0;
    const int CLOSE = 1;

    if ((N & 1) == 1)
    {
        cout << 0 << endl;
        return 0;
    }

    const ll MOD = 998244353LL;

    vector<vector<vector<ll>>> dp(N + 1, vector<vector<ll>>(N + 1, vector<ll>(2)));

    dp[1][1][OPEN] = 1LL;
    for (int i = 2; i <= N; i++)
    {
        for (int j = 0; j <= N; j++)
        {
            // ')'を追加
            if (j <= N - 1)
            {
                dp[i][j][CLOSE] += (dp[i - 1][j + 1][OPEN] + dp[i - 1][j + 1][CLOSE]) % MOD;
            }

            // '('を追加
            if (j >= 1)
            {
                dp[i][j][OPEN] += (dp[i - 1][j - 1][OPEN] + dp[i - 1][j - 1][CLOSE]) % MOD;
            }
        }
    }

    ll ans = 0LL;
    for (int i = 1; i <= N; i++)
    {
        // i文字目の')'の寄与
        for (int j = 1; j <= N; j++)
        {
            int right = N - i;
            ans += ((dp[i][j][CLOSE] * ((dp[right][j][OPEN] + dp[right][j][CLOSE]) % MOD)) % MOD) * (ll)j;
            ans %= MOD;
        }
    }

    cout << ans << endl;
}