PROGRAMMING:How many circles
Given a square with side length N, insert circles with diameter 1, 2, 3, 4,... (nested, but not overlapped, and there is only one circle of each diameter) in turn, and ask how many circles to put at most (no more than four sides of the square, and put as many as possible).
###Input format:
One integer N per line（ 1 ≤ n ≤ $$10^{18}$$）
###Output format:
Output the maximum number of circles.
###Input sample 1:
```in
one
```
###Output sample 1:
```out
one
```
###Input sample 2:
```in
ten
```
###Output sample 2:
```out
ten
```
Note: in a 1 * 1 square, we find that only one circle can be placed at most
answer：If there is no answer, please comment
###Input format:
One integer N per line（ 1 ≤ n ≤ $$10^{18}$$）
###Output format:
Output the maximum number of circles.
###Input sample 1:
```in
one
```
###Output sample 1:
```out
one
```
###Input sample 2:
```in
ten
```
###Output sample 2:
```out
ten
```
Note: in a 1 * 1 square, we find that only one circle can be placed at most
answer：If there is no answer, please comment