Fibonacci Array

Source: beecrowd

Version: Phuoc Hung OJ Extended

Problem Statement

The Fibonacci sequence is defined by

Given an index $N$, compute and print $F_N$. Every Fibonacci value required by the input range fits in an unsigned 64-bit integer.

The original problem contains multiple test cases in one input. The Phuoc Hung OJ version uses one index $N$ per run to match the judge's independent-test-file model.

Input

One line contains the integer $N$.

Output

Print one line in the exact form Fib(N) = X, where N is the given index and $X=F_N$.

Subtasks

Subtask 1 (100 points): $0\le N\le60$.

Examples

Input

60

Output

Fib(60) = 1548008755920

Explanation

For $N=60$, start with $F_0=0$ and $F_1=1$. Every next term is the sum of the previous two. Continuing through index $60$ gives

Therefore the program prints Fib(60) = 1548008755920.