F. Optimal Arithmetic Sequence
time limit per test
1 second
memory limit per test
512 megabytes
input
standard input
output
standard output

Nikita and Olya quickly grew bored during the preliminary round and decided to engage in a more interesting activity. Olya drew several cards, each containing text of the form "$$$c$$$ $$$n$$$", where $$$c$$$ is one of the operations "+", "-", "*" or "/", and $$$n$$$ is a number ranging from $$$1$$$ to $$$9$$$. Now, Nikita must arrange these cards in such a way that the sequential application of the operations to the number one yields the maximum possible value. Help Nikita achieve this.

Input

The first line of the input file contains a single integer $$$n$$$ ($$$1 \leq n \leq 100$$$) — the number of cards drawn by Olya. Each of the following $$$N$$$ lines contains the operation symbol and the associated number written on the respective card, separated by a space.

Output

Output the descriptions of the cards in the optimal order, each on a separate line, maintaining the same format.

Example
Input
8
+ 1
+ 5
- 1
- 2
* 2
* 4
/ 2
/ 3
Output
/ 2
/ 3
+ 1
+ 5
* 2
* 4
- 1
- 2