1337 1/2 Sequence
Submit solution
Points:
100
Time limit:
1.0s
Memory limit:
32M
Problem types
Allowed languages
C, C++, Java, Python
Description
Let's consider an infinite sequence A(i) defined as follows: (1) A(i) = 1, for all i 1, where [x] denotes the floor function of x. floor(x) is the max integer that not bigger then x; You will be given n. Calculate A(n)(index is 0-based).
Input
Each line will contain one integers n (0<=n<=10^9). Process to end of file.
Output
For each n, output the n-th element in one line.
Sample
Input
0
3
5
Output
1
3
5
Source: laddiexu
Comments