hdu5551 水题 Huatuo's Medicine

题意：华佗带了很多药，用链子把他们串起来，然后分不清链子两头，又不想拿错药，假如一共要带n种药，那么问这个链子上至少串几种药，保证华佗不拿错药

思路：因为要对称，直接输出2n-1

Huatuo's Medicine

Time Limit: 3000/1000 MS (Java/Others)    Memory Limit: 65535/65535 K (Java/Others)
Total Submission(s): 105    Accepted Submission(s): 81

Problem Description

Huatuo was a famous doctor. He use identical bottles to carry the medicine. There are different types of medicine. Huatuo put medicines into the bottles and chain these bottles together.

However, there was a critical problem. When Huatuo arrived the patient's home, he took the chain out of his bag, and he could not recognize which bottle contains which type of medicine, but he remembers the order of the bottles on the chain.

Huatuo has his own solution to resolve this problem. When he need to bring 2 types of medicines, E.g.  A  and  B , he will put  A  into one bottle and put  B  into two bottles. Then he will chain the bottles in the order of  ′−B−A−B−′ . In this way, when he arrived the patient's home, he knew that the bottle in the middle is medicine  A  and the bottle on two sides are medicine  B .

Now you need to help Huatuo to work out what's the minimal number of bottles needed if he want to bring  N  types of medicine.

 

Input

The first line of the input gives the number of test cases,  T(1≤T≤100) .  T  lines follow. Each line consist of one integer  N(1≤N≤100) , the number of types of the medicine.

 

Output

For each test case, output one line containing  Case #x: y, where  x  is the test case number (starting from 1) and  y  is the minimal number of bottles Huatuo needed.

 

Sample Input

  
  

   
   1
2
  
  

 

Sample Output

  
  

   
   Case #1: 3
  
  

 

Source

The 2015 China Collegiate Programming Contest