# UUID: 6b94bd99-ddae-4f1e-8386-d754d9c1db34
import sys
sys.setrecursionlimit(10**7)

MOD = 2023
N = int(sys.stdin.readline())

dp = [[0]*4 for _ in range(N+1)]
dp[0][0] = 1


def fill_col(row, cur_mask, next_mask, col, val):
    if row == 2:
        dp[col + 1][next_mask] = (dp[col + 1][next_mask] + val) % MOD
        return

    if cur_mask & (1 << row):
        fill_col(row + 1, cur_mask, next_mask, col, val)
        return

    fill_col(row + 1, cur_mask | (1 << row), next_mask, col, val)

    if row == 0 and not (cur_mask & 2):
        fill_col(2, cur_mask | 3, next_mask, col, val)


    fill_col(row + 1, cur_mask | (1 << row), next_mask | (1 << row), col, val)

    if row == 0 and not (cur_mask & 2):
        fill_col(2, cur_mask | 3, next_mask | 1, col, val)
        fill_col(2, cur_mask | 3, next_mask | 2, col, val)


for i in range(N):
    for mask in range(4):
        val = dp[i][mask]
        if val:
            fill_col(0, mask, 0, i, val)

print(dp[N][0] % MOD)