Type: Default 1000ms 256MiB

Savings

You cannot submit for this problem because the contest is ended. You can click "Open in Problem Set" to view this problem in normal mode.

Background

Special for beginners, ^_^

Description

输入一个正整数 n ,输出一个满足条件的最小的正整数 k ,使得 1+2+...+k≥n

Format

Input

输入一个数字n

Output

输出满足条件的k

Samples

12
5
100128
447

Limitation

1 ≤ N ≤ 10 ^9

周末班结营考试

Not Attended
Status
Done
Rule
IOI
Problem
6
Start at
2025-1-11 14:30
End at
2025-1-11 16:30
Duration
2 hour(s)
Host
Partic.
14