Help a PhD candidate out!

Jon Marius

On his current list Jon Marius has two kinds of problems: addition problems on the form “$a + b$” and the ever returning problem “P=NP”. Jon Marius is a quite distracted person, so he might have to solve this last problem several times, since he keeps forgetting the solution. Also, he would like to solve these problems by himself, so you should skip these.

Input

The first line of input will be a single integer $N$ ($1 \leq N \leq 1\, 000$) denoting the number of testcases. Then follow $N$ lines with either “P=NP” or an addition problem on the form “$a+b$”, where $a, b \in [0, 1\, 000]$ are integers.

Output

Output the result of each addition. For lines containing “P=NP”, output “skipped”.

4
2+2
1+2
P=NP
0+0

4
3
skipped
0