Problem: Wet Shark once had 2 sequences: 
{a_n}= {a_1, a_2, a_3, ... , a_(10^9)}  
{b_n} = {b_1, b_2, b_3, ... , b_(10^9)}  
However, he only kept one element from each sequence. Luckily, both the elements that Wet Shark kept have the same index in Wet Shark's sequences: that is, he took a_i and b_i for some 1 ≤ i ≤ 10^9. 
Right after Wet Shark loses his sequences, he finds that he actually needs them to break the code of Cthulhu to escape a labyrinth. Cthulhu's code is a single floating point number Q. However, the code verifier is faulty. If Wet Shark enters any code c such that |c - Q| ≤ 0.01 , Cthulhu's code checker will allow him to escape.
Wet Shark now starts to panic, and consults Dry Dolphin for help via ultrasonic waves. After the Dry Dolphin Sequence Processing Factory processes data of Wet Shark's sequences, the machines give Wet Shark the following 2 relations his sequences follow for all 1 ≤ n < 10^9, where x = sqrt(2) and y = sqrt(3).



Wet Shark is now clueless on how to compute anything, and asks you for help.
Wet Shark has discovered that Cthulhu's code is actually defined as Q = (a_k + b_k) / (2^s), where s is a predetermined number, k is the index of another element in Wet Shark's sequence, and a_k, b_k are precisely the k^th elements of Wet Shark's sequences {a_n} and {b_n}, respectively.
Given k, i, and the 2 elements of the arrays Wet Shark has lost, find any value of the code c that will allow Wet Shark to exit Cthulhu's labyrinth.

Input
The first line of input contains 3 space separated integers i, k, s — the common index of the two elements Wet Shark kept, the index of Wet Shark's array needed to break Cthulhu's code, and the number s described in the problem statement, respectively. It is guaranteed that Cthulhu's code, Q, is between -10^9 and 10^9 (both inclusive).
The second line of the input contains 2 space separated integers a_i and b_i, representing the i^th element of sequence {a_n} and the i^th element of sequence {b_n}, respectively.

Output
Output any number c that will crack Cthulhu's code. Recall that if Wet Shark enters any code c such that |c - Q| ≤ 0.01 , Cthulhu's code checker will allow him to exit the labyrinth.

 Constraints 

  SUBTASK 1: 20 POINTS  
 1 ≤ i ≤ 10^3 
 1 ≤ k ≤ 10^3 
 -10^3 ≤ s ≤ 10^3 
 1 ≤ a_i, b_i ≤ 10^3 

  SUBTASK 2: 80 POINTS  
 1 ≤ i ≤ 10^10 
 1 ≤ k ≤ 10^10 
 -10^10 ≤ s ≤ 10^10 
 1 ≤ a_i, b_i ≤ 10^10 

It is guaranteed that -10^10 ≤ Q ≤  10^10.

Example
Input:
1 1 5
4 5

Output:
0.28125



Explanation
Example case 1. In this case, a_1 = 4, b_1 = 5, and s = 5. Cthulhu's code in this case is (a_1 + b_1) / (2^s) = 9/32 = 0.28125.

Solution (in PYTHON):

Solution:
#!/bin/python
import math

i, k, s = map(int, raw_input().split())
a, b = map(int, raw_input().split())
x = math.sqrt(2.0)
y = math.sqrt(3.0)

sum = float(a+b)

remain = (k-i) % 2
if remain:
  sum = 2*x*a+2*x*y*b

s1 = 4*((k-i)/2) - s
c = sum * (2 ** s1)
print c