A sequence of numbers
a1, a2, …, ai,… is called Fibonacci if for all ;
i >= 3 true that
ai = ai– 1 + ai–2, that is, each member of the sequence (starting from the third) is equal to the sum of the two previous ones. It is clear that by setting different numbers
a 1 and
a2 we can get various such sequences, and any Fibonacci sequence is uniquely given by its two first terms.
Let's solve the reverse problem. You will be given a number
N and two members of the sequence:
aN and
aN+1. You need to write a program that, given their values, will find a1 and a2.
Input
The number N and the values of the two members of the sequence are entered: aN and aN+1 (1 <= N <= 30, sequence members are integers, modulo not exceeding 100).
If you write in the Python programming language, then reading aN and aN+1 elements should be organized like this :
x, y = map(int, input().split()).
Imprint
Print two numbers — the values of the first and second members of this sequence.
Examples
| # |
Input |
Output |
| 1 |
4
3 5
| 1 1 |