This page is still under construction.

Parts of this page are still being built. What you see may change.

PhD Program

Time limit1sMemory limit128 MB

Summary
Read N problems, output a+b for each addition line and 'skipped' for the line P=NP.
Level

Easy1 of 10

Topics
Implementation, String
Solved
No attempts yet

Problem

While writing his doctoral dissertation, Donghyuk forgot how to add two numbers. He has to finish an entire problem sheet made up of addition problems and one computer science problem in order to earn his military-service exemption.

Each addition problem on the sheet is written in the form a+b, and there is exactly one computer science problem, P=NP. Given Donghyuk's problem sheet, write a program that produces the answer to every problem in order.

Input

The first line contains the number of problems NN (1≤N≤10001 \le N \le 1000).

Each of the next NN lines contains either an addition problem in the form a+b or the string P=NP. Here aa and bb are integers with 0≤a,b≤10000 \le a, b \le 1000.

Output

For each problem, print the answer on its own line. If the problem is P=NP, print skipped; if it is an addition problem, print the value of a+ba+b.

Examples1

  1. Example 1

    Input
    4
    2+2
    1+2
    P=NP
    0+0
    
    Expected output
    4
    3
    skipped
    0