Consider the sequence of numbers a[i], i = 0, 1, 2, ..., which
satisfies the following requirments:
a = 0
a = 1
a[2i] = a[i]
a[2i+1] = a[i] + a[i+1]
for every i=1, 2, 3, ... .
Write a program which for a given value of N (0 < N < 1018) finds
the largest number among the numbers a, a, ..., a[N].
Input contains not more than 10000 lines containing one number N. The last line contains 0.
For every N in the input write the corresponding maximum value found.
This problem is the same as “Maximum
” but with bigger limitations.
Problem Author: Prepared by Vladimir Yakovlev