Largest Triangular Sum Below N
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