E. Enigma
time limit per test
1 second
memory limit per test
1024 megabytes
input
standard input
output
standard output

Leo Turing is a scientist with incredible discoveries, one of the most renowned in Computer Science; his most influential work is his study on encryption in search engines.

At this very moment, he is trying to break the encryption code to uncover the enemy's search history during the Second World Hackathon and has encountered a new challenge.

Turing wants to find two unknown values $$$A$$$ and $$$B$$$, which are crucial for decoding the enemy's searches. However, the only known values are $$$X$$$ and $$$Y$$$, which represent the following:

  • $$$X = A + B$$$
  • $$$Y = |A - B|$$$

To find these values, he asked for your help. Given $$$X$$$ and $$$Y$$$, print two values $$$A$$$ and $$$B$$$ that satisfy the conditions above. Turing guarantees that $$$A$$$ and $$$B$$$ exist and are uniquely determined for the inputs he will provide to your program.

Input

The input contains two lines. The first line contains the number $$$X$$$ ($$$0 \leq X \leq 10^9$$$), and the second line contains the number $$$Y$$$ ($$$0 \leq Y \leq 10^9$$$).

Output

Print two values $$$A$$$ and $$$B$$$ that satisfy the problem conditions. You may print them in any order.

Examples
Input
10
2
Output
4 6
Input
3
7
Output
-2 5
Input
10
10
Output
0 10