Michael is exploring a variation of Fibonacci numbers and has defined a sequence where the first sum is y = a + x. Subsequent sums follow the pattern of Fibonacci numbers: z = x + y, t = y + z, and so forth. The sequence continues for a total of terms. The sum of the pair of numbers in the last term of this sequence equals . For example, if n = 4, the last term would be t + z = b. Given the values n, a, b, your task is to determine the value of .
You will receive the values n, a, b as a single line of input, separated by spaces. The constraints are as follows: 3 \leq n \leq 25, 1 \leq a \leq 10, and 20 \leq b \leq 1000.
Print the value of .
Example 1