Problem hidden
This problem was hidden by Editorial Board member probably because it has incorrect language version or invalid test data, or description of the problem is not clear.
Problem hidden

MATCHCNT - How many match?

Mr. X is Vice-president of FIFA. He wants to arrange a worldwide football tournament. There is no group stage in this tournament and all match will be played knockout system(The player loss will eliminate ).

 

Its time for making fixure. First he need to calculate number of match will have.But he has not enough time for calculaing.So he ask you for write a programme for calculate the number of match if N player perticipate in the tournament.

Input

First line contains one integer T denotes the number of  testcase.

Then the following T(1<=T<=1000) lines contains an integer  N (2<=N<=10^18) - number of participants (N must be represented as 2x where x=1,2,3….).

Output

For each case, print the case number and number of match need to arrange

Example

Input:

2

2

4

Output:

Case 1: 1

Case 2: 3

Added by:Murad
Date:2016-05-03
Time limit:1s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All except: ASM64 GOSU JS-MONKEY
© Spoj.com. All Rights Reserved. Spoj uses Sphere Engine™ © by Sphere Research Labs.