**Challenge 1** - Team Lunch

Today is our bi-weekly team lunch! This time, we're going to our favorite Indian restaurant and we want to know in advance the minimum number of tables required to seat all the team members.

All the tables are square shaped, they must always be joined in a row and there can be no more than one diner seated at each side of a table.

### Example for 4 diners:

O +---+ O | 1 | O +---+ O 4 diners -> 1 table

### Example for 5 diners:

O O +---+---+ O | 1 | 2 | +---+---+ O O 5 diners -> 2 tables

### Input

In the first line, an integer T indicates the number of cases. Each case is described in a line with an integer N indicating the number of diners.### Output

For each case**t**, the output is the string

**Case #t: r**where

**t**is the case number and

**r**is the result.

### Limits

1 <= T <= 50

0 <= N <= 2^16

### Sample Input

4 4 6 5 3

### Sample Output

Case #1: 1 Case #2: 2 Case #3: 2 Case #4: 1

**NOTE:** Take into account that apart from submitting the correct solution as soon as possible, code quality is also important as it will be reviewed if you end up in the top of the ranking.

### Problem stats

Completion time: |
10 percentile: 0:17 h90 percentile: 23:35 h |
---|---|

Submit exec time: |
min: 5.00 s10 percentile: 48.00 s90 percentile: 564.25 smax: 437683.92 s |

Test tries: |
min: 110 percentile: 190 percentile: 9max: 120 |

# of completions: | 780 |