Within 2 of a Multiple of 10

Background

Congcong is currently studying number properties. He wants to know if a given non-negative integer is "close" to a multiple of 10.

Problem Description

Given a non-negative number num, return true if num is within 2 of a multiple of 10. This means that the result of $num \pmod{10}$ is $0, 1, 2, 8,$ or $9$.

For example, if a number is a multiple of 10, its distance to a multiple of 10 is $0$. If a number is a multiple of 10 plus or minus $1$, the distance is $1$. If a number is a multiple of 10 plus or minus $2$, the distance is $2$.

Note: (a % b) is the remainder of dividing $a$ by $b$, so (7 % 5) is $2$.

Input Format

Input is given from standard input in the following format.

num (a non-negative integer)

Output Format

Output is printed to standard output in the following format.

true or false

Sample

12

true

17

false

19

true

Sample Explanation

• Sample 1: num = 12. $12 \pmod{10} = 2$. Since $2 \le 2$, return true.
• Sample 2: num = 17. $17 \pmod{10} = 7$. Since $7$ does not satisfy $7 \le 2$ nor $7 \ge 8$, return false.
• Sample 3: num = 19. $19 \pmod{10} = 9$. Since $9 \ge 8$, return true.

Constraints

Time limit: 1 second, Memory limit: 1024 KiB for each test case. num is a non-negative integer.