For Kisses

Time Limit: 1000ms
Memory Limit: 32768KB
This problem will be judged on HDU. Original ID: 2849
64-bit integer IO format: %I64d      Java class name: Main

Description

WisKey has a little lovely sister named Sweet. One day Sweet wants play a game with him. The game rules like this, in the N*N girds, you can choose K girds to make any 4 of grids not rectangles vertexes, Sweet say if WisKey can find out the max K, she will give him a Kiss !!
WoW, this is a funny and cute challenge, everybody rise UP~
This is not rectangle.
This is a rectangle.

Input

The Sweet just has 9 questions, any questions have an N(N<=21). and WisKey want 9 Kisses!

Output

For each questions, output the max possible K.

Sample Input

1
2
3
4
5
6
7
13
21

Sample Output

1
3
.
.
.

Source

Language: 
Theme: 
Share Code? 

Powered by NB231 | Current Style: .