# Tuenti Challenge 10

## Challenge 5 - Tuentistic Numbers

A Tuentistic number is any number that, when written in English, contains the word “twenty” (for example, 20, 21 or 120000). Since at Tuenti we love Tuentistic numbers, we like to represent any non-Tuentistic number as a sum of positive Tuentistic numbers in order to increase their Tuentisticness (this is called a Tuentistic sum). For example, the non-Tuentistic number 50 can be represented as the Tuentistic sum 25 + 25. The Tuentistic numbers thenselves count as Tuentistic sums too.

Given a positive number, we want to know the maximum number of elements of its Tuentistic sums.

### Input

The first line contains the number of cases C. Then, C lines follow, each with a number N.

### Output

For each case, output 'Case #X: M', where X is the case number (the first case has number 1) and M is the maximum number of elements in a Tuentistic sum of N. If it is not possible to represent N as any Tuentistic sum, write 'Case #X: IMPOSSIBLE' instead.

• 1 ≤ C ≤ 500
• 1 ≤ N ≤ 262

```3
20
80
35
```

### Sample Output

```Case #1: 1
Case #2: 4
Case #3: IMPOSSIBLE
```

In the first case, the number 20 has only one Tuentistic sum which contains itself, so the answer is 1.
In the second case, 80 can be represented as a sum of 4 Tuentistic numbers (20+20+20+20).
In the third case, it's impossible to sum 35 with only Tuentistic numbers.

You can test your program against both the input provided in the test phase and the input provided in the submit phase. A nice output will tell you if your program got the right solution or not. You can try as many times as you want. Be careful with extra whitespace. The output should be exactly as described.

Program output: