TRYANGLE - Triangle

no tags 

Arko is a little boy. He loves to watch the stars in the sky at night. Every night he makes various shapes (triangle, square, circle etc) by joining the stars and tries to count the number of shapes. But he makes confusion in counting the number of triangles. So he has come to you. He will tell you the number of the stars. Now you have to write a program that will show the maximum number of triangles.

Input

The input will start with a positive integer T (0 < T <= 1000). In next line there will be an integer S (3 <= S <= 2000) denoting the number of the stars.

Output

Print the test case and the maximum number of triangles that can be form by the stars.

Example

Input:
2
4
10

Output:
Case 1: 4
Case 2: 120

Problem Setter: Shipu Ahamed, Dept. of CSE
Bangladesh University of Business and Technology (BUBT)



Added by:Shipu Ahamed
Date:2013-06-29
Time limit:1s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All except: ASM64