Codeforces Round 280 (Div. 2) |
---|

Finished |

Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

implementation

*800

No tag edit access

The problem statement has recently been changed. View the changes.

×
A. Vanya and Cubes

time limit per test

1 secondmemory limit per test

256 megabytesinput

stdinoutput

stdoutVanya got *n* cubes. He decided to build a pyramid from them. Vanya wants to build the pyramid as follows: the top level of the pyramid must consist of 1 cube, the second level must consist of 1 + 2 = 3 cubes, the third level must have 1 + 2 + 3 = 6 cubes, and so on. Thus, the *i*-th level of the pyramid must have 1 + 2 + ... + (*i* - 1) + *i* cubes.

Vanya wants to know what is the maximum height of the pyramid that he can make using the given cubes.

Input

The first line contains integer *n* (1 ≤ *n* ≤ 10^{4}) — the number of cubes given to Vanya.

Output

Print the maximum possible height of the pyramid in the single line.

Examples

Input

1

Output

1

Input

25

Output

4

Note

Illustration to the second sample:

Codeforces (c) Copyright 2010-2024 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Aug/07/2024 17:37:22 (j1).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|