Maximum ⬀
Consider the sequence of numbers aᵢ, i = 0, 1, 2, …, which satisfies the following requirements:
a₀ = 0a₁ = 1a₂ᵢ = aᵢa₂ᵢ₊₁ = aᵢ + aᵢ₊₁
for every i = 1, 2, 3, … .
Write a program which for a given value of n finds the largest number among the numbers a₀, a₁, …, aₙ.
You are given several test cases (not more than 10). Each test case is a line containing an integer n (1 ≤ n ≤ 99 999). The last line of input contains 0.
For every n in the input write the corresponding maximum value found.
| input | output |
|---|---|
5 10 0 |
3 4 |