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

#define ll long long
#define pb push_back
#define mp make_pair
#define pii pair<int, int>
#define fi first
#define se second

const int mod = 2023;

void solve() {
    int n;
    cin >> n;
    vector<int> fel(1 + n, 0), egesz(1 + n, 0), reszfel(1 + n, 0);
    egesz[0] = 1;
    fel[1] = 1;
    egesz[1] = 2;
    for(int i = 2; i <= n; i++) {
        reszfel[i] = (fel[i - 1] + egesz[i - 2]) % mod;
        // ez tuti jo
        fel[i] = (egesz[i - 1] + fel[i - 1] + egesz[i - 2]) % mod;
        // ketszer szamoljuk: ha ket kicsi van a legvegen
        egesz[i] = (2 * egesz[i - 1] + egesz[i - 2] + 2 * reszfel[i] + 2 * fel[i - 1]) % mod;
    }
    cout << egesz[n] << "\n";
}

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    solve();
    return 0;
}