Problem - 1183A - Codeforces

Polycarp knows that if the sum of the digits of a number is divisible by $3$ , then the number itself is divisible by $3$ . He assumes that the numbers, the sum of the digits of which is divisible by $4$ , are also somewhat interesting. Thus, he considers a positive integer $n$ interesting if its sum of digits is divisible by $4$ .

Help Polycarp find the nearest larger or equal interesting number for the given number $a$ . That is, find the interesting number $n$ such that $n \ge a$ and $n$ is minimal.

Input

The only line in the input contains an integer $a$ ( $1 \le a \le 1000$ ).

Output

Print the nearest greater or equal interesting number for the given number $a$ . In other words, print the interesting number $n$ such that $n \ge a$ and $n$ is minimal.

Examples

Input

Output

Input

Output

Input

Output

Input

Output

Codeforces Round 570 (Div. 3)
Finished

→ Virtual participation

Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests. If you've seen these problems, a virtual contest is not for you - solve these problems in the archive. If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive. Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

→ Problem tags

implementation

*800

No tag edit access