Check for Special Number

Background

Congcong has recently been studying number properties. He discovered that some numbers have unique characteristics and wants to write a program to identify them.

Problem Description

We define a non-negative number as "special" if it meets either of the following conditions:

1. It is a multiple of $11$.
2. It is one more than a multiple of $11$.

Given a non-negative number, return true if it is special, otherwise return false. You should use the modulo operator (%).

Input Format

The input consists of a single non-negative integer $n$.

$n$

Output Format

Output true if $n$ is a special number; otherwise, output false.

true or false

Sample

22

true

23

true

24

false

Sample Explanation

• Sample 1: $22$ is a multiple of $11$ ($22 = 11 \times 2$), so it is a special number. Output true.
• Sample 2: $23$ is one more than a multiple of $11$ ($23 = 11 \times 2 + 1$), so it is a special number. Output true.
• Sample 3: $24$ is neither a multiple of $11$ nor one more than a multiple of $11$ ($24 = 11 \times 2 + 2$), so it is not a special number. Output false.

Constraints

For each test case, the time limit is $1$ second, and the memory limit is $1024$ KiB.