The 5th Liaoning Collegiate Programming Contest is in full swing! Contestants who registered individually need to be matched to the competition system to compete against opponents. Within a limited time, they must solve more problems than their opponents from a set of 9 programming problems to advance to the next round.

Some contestants rely on their quick wits to solve difficult problems and advance easily. Others rely on their fast typing speed, hammering away at their keyboards like thunder. But Ya-Pei is different; he only needs to adopt a "slacking" strategy at the beginning of the match, waiting for his opponent to open the problem set, and then at some point during the match, he uses his "Score Magic" without anyone (including his opponent) noticing — he swaps the number of problems he has solved with the number of problems his opponent has solved.

As for the rest of the competition, it is irrelevant. You only need to care about what the original score "A-B" becomes after Ya-Pei uses his "Score Magic". You are given the scores before and after the swap, where the number of problems solved by Ya-Pei is on the left and the number of problems solved by his opponent is on the right. There is no guarantee that the opponent's score is necessarily lower than Ya-Pei's in the original score.

Note: The above story is purely fictional. Please do not slack off during the competition, and do not attempt to use "superpowers".

Input

A single line in the format "A-B" ($0 \le A, B \le 9$), representing the original score.

Output

A single line, outputting the score after Ya-Pei uses "Score Magic" in the same format.

Examples

Input 1

2-3

Output 1

3-2