시간 제한 메모리 제한 제출 정답 맞은 사람 정답 비율
1 초 128 MB 93 47 43 75.439%

문제

In the Fibonacci integer sequence, F0 = 0, F1 = 1, and Fn = Fn−1 + Fn−2 for n ≥ 2. For example, the first ten terms of the Fibonacci sequence are:

0, 1, 1, 2, 3, 5, 8, 13, 21, 34, . . .

An alternative formula for the Fibonacci sequence is

\[\begin{bmatrix} F_{ n+1 } & F_{ n } \\ F_{ n } & F_{ n-1 } \end{bmatrix}=\begin{bmatrix} 1 & 1 \\ 1 & 0 \end{bmatrix}^n\]

Given an integer n, your goal is to compute the last 4 digits of Fn.

입력

The input test file will contain multiple test cases. Each test case consists of a single line containing n (where 0 ≤ n ≤ 1,000,000,000). The end-of-file is denoted by a single line containing the number -1.

출력

For each test case, print the last four digits of Fn. If the last four digits of Fn are all zeros, print ‘0’; otherwise, omit any leading zeros (i.e., print Fn mod 10000).

예제 입력

0
9
999999999
1000000000
-1

예제 출력

0
34
626
6875

힌트