Problem Statement

Brainfxxk (xx=uc) is $1$ of the esoteric programming languages. This language consists of $8$ kinds of instructions: +, -, >, <, ., ,, [, ].

Yu-ti has decided to reproduce, out of the $8$ kinds of instructions, the $4$ kinds of instructions +, -, >, <.
The behavior of each instruction is as follows.

• + : Adds $1$ to the value of the data at the pointer's number (adds $1$ to the value of the data the pointer points to)
• - : Subtracts $1$ from the value of the data at the pointer's number (subtracts $1$ from the value of the data the pointer points to)
• > : Adds $1$ to the pointer's number (moves the pointer forward by $1$)
• < : Subtracts $1$ from the pointer's number (moves the pointer backward by $1$)

• $N$ pieces of data are placed in $1$ row, and the pieces of data are numbered $1$, $2$,$ \cdots$, $N$ from the front.
• The value of each piece of data is initially $0$.
• The pointer's number is initially $1$.

Constraints

• $1 \leq N \leq 10 $
• $1 \leq |S|\leq 100$
• The string $S$ consists of +, -, >, <.

Input

$N$ 
$S$

Line $1$ contains $N$, the number of pieces of data.
Line $2$ contains $S$, the code string.

Output

If the pointer takes the number of a nonexistent piece of data even $1$ time, output error.
Otherwise, output the value of each piece of data separated by spaces on $1$ line.
Print a newline at the end.

Sample

3
+++>--

3 -2 0

3
<>>>>

error

1
+-+-+-+-+-

0