Bajtazar has been spending a lot of time at the local gym lately. He has access to an unlimited number of weights weighing 3 and 8 kilograms each. He would like to exercise with a load of $n$ kilograms. Is it possible for him to obtain such a load using the available weights?
Input
The first and only line of input contains a single integer $n$ ($1 \le n \le 10^9$).
Output
In the first and only line of output, print the word TAK (Yes) or NIE (No), indicating whether it is possible to obtain a load of $n$ kilograms using the available weights, or that it is not possible, respectively.
Examples
Input 1
19
Output 1
TAK
Note 1
$19 = 8 + 8 + 3$
Note
Sample tests: Test 0a is the test from the example above. Additionally: 0b: $n = 10$, answer: NIE. 0c: $n = 10^9$, answer: TAK, only 8 kg weights.
Subtasks
The test set is divided into the following subtasks. Tests for each subtask consist of one or more separate test groups.
| Subtask | Constraints | Points |
|---|---|---|
| 1 | $n \le 24$, if it is possible to obtain a load of $n$ kilograms, it is possible using at most 3 weights | 20 |
| 2 | $n \le 1000$ | 30 |
| 3 | no additional constraints | 50 |