The package for this problem was not updated by the problem writer or Codeforces administration after we've upgraded the judging servers. To adjust the time limit constraint, a solution execution time will be multiplied by 2. For example, if your solution works for 400 ms on judging servers, then the value 800 ms will be displayed and used to determine the verdict.

Unknown Language Round 1 |
---|

Finished |

The following languages are only available languages for the problems from the contest

Unknown Language Round 1:

- ActiveTcl 8.5

Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

*special problem

expression parsing

*1500

No tag edit access

The problem statement has recently been changed. View the changes.

×
B. Expression

time limit per test

2 secondsmemory limit per test

64 megabytesinput

standard inputoutput

standard outputYou are given a line «n#m», where «n» and «m» are digits, and «#» is a sign «+» or «-». Print the value of the given expression.

Input

The only given line has a string in form «n#m», where «n» and «m» are digits (from 0 to 9), and «#» is a sign «+» or «-».

Output

Print the value of the given expression.

Examples

Input

1-5

Output

-4

Codeforces (c) Copyright 2010-2024 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Apr/14/2024 04:27:35 (j2).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|