#include <iostream>
#include <vector>
#include <set>
#include <queue>

using namespace std;
int mod = 2023;
int main()
{
    int n;
    cin >> n;
    vector<int> DPa = vector<int>(n+1);
    vector<int> DPb = vector<int>(n+1);
    vector<int> DPc = vector<int>(n + 1);
    DPa[0] = 1;
    DPa[1] = 2;
    DPb[0] = 0;
    DPb[1] = 2;
    DPc[0] = 1;
    DPc[1] = 2;
    for (size_t i = 1; i < n; i++)
    {
        //DPa cases
        DPa[i + 1] += DPc[i];
        DPa[i + 1] += 2 * DPb[i];
        DPa[i + 1] += 2 * DPb[i - 1];
        DPa[i + 1] += 2 * DPc[i - 1];
        DPa[i + 1] += DPa[i];
        DPa[i + 1] += DPa[i - 1];
        //DPb cases
        DPb[i + 1] += DPb[i];
        DPb[i + 1] += DPc[i];
        DPb[i + 1] += DPa[i];
        //DPc cases
        DPc[i + 1] += DPa[i+1];
        //mod
        DPa[i + 1] = DPa[i + 1] % mod;
        DPb[i + 1] = DPb[i + 1] % mod;
        DPc[i + 1] = DPc[i + 1] % mod;
    }
    cout << DPa[n];
}