SP21332 PHT - Pigeonhole Tower
Description
Pigeon SSNA want to build a tower with some wood walls. Let's describe the tower they want to make:
1. A Tower can consist of different number of level.
2. If a tower contain **L** levels then 1 $ ^{st} $ level must contain **L** holes , 2 $ ^{nd} $ level **L-1 ,** 3 $ ^{rd} $ level **L-2** ….. **L** level contain 1 hole .
3. Each room contain 3 wood walls.
See the picture below:
  3 Level Tower 4 Level towerNow pigeon SSNA has **n** wood walls. What is maximum number of level he can made.
Input Format
Input starts with an integer **T** (
Each case starts with a line containing an integer **n** (1 n
Output Format
For each case of input you have to print the case number and expected answer.
**Sample Input**
**Output for Sample Input**
```
2
15
24
```
```
Case 1: 3
Case 2: 4
```