Problem Background

Goodbye, 2022

Hello, 2023

Problem Description

E's lucky number for the year 2022 is $x$, which could be positive or negative.

E wants to know the value of $x \bmod 2023$. Here, $\bmod$ denotes the modulo operation, which means you need to find the remainder when $x$ is divided by $2023$. This remainder must be a non-negative integer.

For example, $2022 \bmod 2023 = 2022$, $2025 \bmod 2023 = 2$, $-2 \bmod 2023 = 2021$, and $-2026 \bmod 2023 = 2020$.

Specifically, $x = k \times 2023 + r$, where $0 \le r < 2023$ and both $k$ and $r$ are integers. You need to find this $r$.

Note: If you use the modulo operator ($\texttt{\%}$) in C/C++ for negative numbers, you will get a negative result. To obtain the correct modulo result, you need to add the modulus to this negative result.

Input Format

A single line containing an integer $x$.

Output Format

Output the value of $x \bmod 2023$.

Sample Input and Output

Sample Input #1

2022

Sample Output #1

2022

Sample Input #2

2025

Sample Output #2

2

Sample Input #3

-2

Sample Output #3

2021

Sample Input #4

-2026

Sample Output #4

2020

Notes

For 60% of the test cases, $x > 0$;
For 100% of the test cases, $|x| \le 10^9$.

见题面 Input 部分

见题面 Output 部分