// UUID: 8b585f1f-fe89-4cb8-9ba4-68754dccd114
#include <bits/stdc++.h>
 
using namespace std;
 
#define ll long long
#define fs first
#define sc second
#define pb push_back
#define pll pair<ll, ll>
#define vll vector<ll>
#define v2ll vector<vll>
#define pqll priority_queue<ll>

const ll mod = 1e9+7;
const ll inf = LONG_LONG_MAX;

ll n;

void solve()
{
    cin >> n;
    vll dp(n+1, 0), dp2(n+1, 0);
    dp[0] = 1; dp[1] = 2; dp2[0] = 1; dp2[1] = 1;
    for (ll i = 2; i <= n; i++) {
        dp[i] = dp[i-1]*2 + dp[i-2]*3 + dp2[i-1]*4;
        dp2[i] = dp[i-1] + dp2[i-1] + dp[i-2];
        dp[i] %= 2023; dp2[i] %= 2023;
    }
    cout << dp[n];
}
 
signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL); cout.tie(NULL);
    ll t = 1;
    //cin >> t;
    while(t--)
    {
        solve();
    }
    return 0;
}