A. Trilobyte
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

After time-travelling far into the past, you arrive in the Cambrian age. After looking around, you discover a sentient trilobite species that can communicate, but only using multiples of $$$8$$$. Being a Computer Science student, you decide to name this species 'Trilobyte'. You spend several weeks communicating with the Trilobytes and learn many new facts about their lives. Right as you are about to travel to the Jurassic age, one Trilobyte starts to say something, but you do not get the full message. You wonder, what did the Trilobyte want to say?

Let the portion of the message you heard be the integer $$$n$$$. What is the smallest non-negative integer $$$k$$$ such that appending it to the end of $$$n$$$ produces a multiple of $$$8$$$? $$$k$$$ cannot have leading zeros. $$$0$$$ and $$$13$$$ are valid values of $$$k$$$, but $$$00$$$ and $$$001$$$ are not.

Input

The first line of input contains a single integer $$$n$$$ ($$$1\le n\le 10^6$$$) — the portion of the message you heard.

Output

Output a single number $$$k$$$, the smallest non-negative integer (without any leading zeros) such that when $$$k$$$ is appended to $$$n$$$, the result is a multiple of $$$8$$$.

Example
Input
51
Output
2
Note

$$$51$$$ is the portion of the message we saw, and $$$2$$$ is the smallest non-negative integer that works for this since appending $$$2$$$ to $$$51$$$ gives $$$512$$$, which is a multiple of $$$8$$$. $$$(512 = 8\cdot 64)$$$