#include <bits/stdc++.h>
using namespace std;
#define f(i,k,n) for(int i=k; i<n; i++)
#define ll long long
const int inf = INT_MAX;
const int mod = 2023;
void solve()
{
    int n;
    cin>>n;
    int x[n];
    x[0]=2;
    x[1]=11;
    int y[n];
    y[0]=1;
    y[1]=4;
    f(i,2,n)
    {
        x[i]=(x[i-1]*2 + x[i-2]*3 + y[i-1]*4)%mod;
        y[i]=(y[i-1] + x[i-1] + x[i-2])%mod;
    }
    cout<<x[n-1]<<"\n";
}

int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    int t=1;
    //cin>>t;
    while(t--)  solve();
    return 0;
}