Given a sequence of integer numbers,
print the first pair *x* and *y* with exactly an integer in the middle,
and such that the remainder of divide *x*+*y* by 100 is 1.

**Input**

Input is a sequence of, at least, three integer numbers. In absolute value, none of them is greater than 1000000.

**Output**

Your program must print the first pair of integer numbers *x* and *y*
with exactly an integer in the middle in the input sequence,
and such taht the remainder of divide *x*+*y* by 100 is 1.
If this pair does not exist, indicate it.
Follow the format of the examples.

**Observation**

Be careful with the modulo of negative numbers!

Public test cases

**Input**

5 10 -3 20 204 81 18

**Output**

-3 204

**Input**

1 2 3 4 5 6 7 8 9 10

**Output**

The searched pair does not exist.

**Input**

-1000 0 1

**Output**

-1000 1

Information

- Author
- Salvador Roura
- Language
- English
- Translator
- Carlos Molina
- Original language
- Catalan
- Other languages
- Catalan
- Official solutions
- C++
- User solutions
- C++