Problem1051--Build staircases

1051: Build staircases

[Creator : ]
Time Limit : 1.000 sec  Memory Limit : 128 MiB

Description

Given N bricks to make different kinds of staircases,  
each type of staircase should consist of 2 or more steps.  No two steps are allowed to be at the same height - each step must be lower than the previous one. All steps must contain at least one brick. A step's height is classified as the total amount of bricks that make up that step.
For example, when N = 3, here is the staircase you can make:
*
**
Only one of the staircase
When N = 7
*
*
*
*
*
**
===========
*
*
*
**
**
===========
*
**
**
**
===========
*
*
**
***
===========
In total 4 of them


Input

one integer which is N ( N <= 200 )

Output

one integer which is the number of different kinds of staircases

Sample Input Copy

7

Sample Output Copy

4

Source/Category