Largest Triangular Sum Below N


Submit solution

Points: 100
Time limit: 2.0s
Memory limit: 256M

Author:
Problem types

Find the largest integer \(m>=0\) such that \(1+2+\cdots+m<n\).

Input

One positive integer \(n\).

The input satisfies:

  • \(n >= 1\)

Output

Print the legacy labels followed by \(m\).

Example

Input
1
Output
N = m lon nhat = 0

Comments

There are no comments at the moment.