Problem:
 Score : 100 points    Problem Statement Joisino wants to evaluate the formula " A  op  B ".
Here, A and B are integers, and the binary operator op is either + or - .
Your task is to evaluate the formula instead of her.      Constraints  1≦A,B≦10^9  op is either + or - .         Input The input is given from Standard Input in the following format:  A  op  B       Output Evaluate the formula and print the result.        Sample Input 1 1 + 2      Sample Output 1 3  Since 1 + 2 = 3 , the output should be 3 .       Sample Input 2 5 - 7      Sample Output 2 -2

Solution (Python):
a,o,b=input().split()
a=int(a)
b=int(b)
print(a+b if o=="+" else a-b)

Solution (Python):
a,p,b = map(str,input().split())
a = int(a)
b = int(b)
if p == "+":
  print(a+b)
else:
  print(a-b)

Solution (Python):
import sys
def input(): return sys.stdin.readline().strip()
def mapint(): return map(int, input().split())
sys.setrecursionlimit(10**9)

A, op, B = input().split()
if op=='+':
    print(int(A)+int(B))
else:
    print(int(A)-int(B))

Solution (Python):
a,op,b = input().split()
print(eval(a+op+b))

Solution (Python):
lst=list(input().split())

if lst[1] == '+':
    print(int(lst[0])+int(lst[2]))
else:
    print(int(lst[0])-int(lst[2]))

Solution (Python):
a, op, b = input().split()

if op == '+':
    print(int(a) + int(b))
else:
    print(int(a) - int(b))

Solution (Python):
a,o,b=input().split()
a=int(a)
b=int(b)
print(a+b if o=="+" else a-b)

Solution (Python):
s = input()
print(eval(s))

Solution (Python):
a, op, b = input().split()
a,b = int(a), int(b)
print(a+b if op == '+' else a-b)

Solution (Python):
s = input().split()
if s[1] == "+":
  print(int(s[0])+int(s[2]))
else:
  print(int(s[0])-int(s[2]))

Solution (Python):
def resolve():
    A, op, B = input().split()
    if op == "+":
        result = int(A) + int(B)
    elif op == "-":
        result = int(A) - int(B)
    print(result)

resolve()

Solution (Python):
print(eval(input()))

Solution (Python):
li = input().split()
 
if li[1] == "+":
  print(int(li[0])+int(li[2]))
else:
  print(int(li[0])-int(li[2]))

Solution (Python):
a, op, b = input().split()
if op == "+":
    print(int(a) + int(b))
else:
    print(int(a) - int(b))

Solution (Python):
a,o,b = input().split()
if o == '+':
    print(int(a) + int(b))
else:
    print(int(a) - int(b))

Solution (Python):
A,op,B=input().split()
a=int(A)
b=int(B)

if op=='+':
  print(a+b)
else:
  print(a-b)

Solution (Python):


def main():

    A, op , B = map(str, input().split())

    if op == '+':
        ans = int(A) + int(B)
    
    elif op == '-':
        ans = int(A) - int(B)

    print(ans)


if __name__ == "__main__":
    main()

Solution (Python):
a,o,b=input().split()
if o=='+':
  print(int(a)+int(b))
else:
  print(int(a)-int(b))

Solution (Python):
a,op,b=map(str,input().split())
a=int(a)
b=int(b)
if op=="+":
    print(a+b)
else:
    print(a-b)

Solution (Python):
a, op, b = input().split(' ')
a = int(a)
b = int(b)

if(op == '+'):
    print(a + b)
else:
    print(a - b)

Solution (Python):
print(eval(input()))

Solution (Python):
a,op,b=input().split()
a,b=int(a),int(b)
if op=="+":
    print(a+b)
else:
    print(a-b)

Solution (Python):
S = input()
print(eval(S))

Solution (Python):
a,x,b=input().split()
if x == "+":
  print(int(a)+int(b))
else:
  print(int(a)-int(b))

Solution (Python):
a, b, c = input().split()

if b == '+':
    print(int(a)+int(c))
else:
    print(int(a)-int(c))

Solution (Python):
import sys

read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007


def main():
    A, op, B = readline().split()
    A, B = int(A), int(B)
    if op == '+':
        print(A + B)
    else:
        print(A - B)

    return


if __name__ == '__main__':
    main()

Solution (Python):
print(eval(input()))

Solution (Python):
A,op,B=input().split()
if op=="+":
    print(int(A)+int(B))
else:
    print(int(A)-int(B))

Solution (Python):
A,OP,B=input().split()

a,b=int(A),int(B)
op=str(OP)

if op =='+':
    ans=a+b
else:
    ans=a-b
    
print(ans)

Solution (Python):
a,o,b = map(str,input().split())
if o == "+":
  print(int(a) + int(b))
else:
  print(int(a) - int(b))

Solution (Python):
s = input()
print( eval(s) )

Solution (Python):
a,b,c=map(str, input().split())
if b=="+":
  print(int(a)+int(c))
else:
  print(int(a)-int(c))

Solution (Python):
import bisect, collections, copy, heapq, itertools, math, string, sys
input = lambda: sys.stdin.readline().rstrip() 
sys.setrecursionlimit(10**7)
INF = float('inf')
def I(): return int(input())
def F(): return float(input())
def SS(): return input()
def LI(): return [int(x) for x in input().split()]
def LI_(): return [int(x)-1 for x in input().split()]
def LF(): return [float(x) for x in input().split()]
def LSS(): return input().split()

def resolve():
    a, op, b = LSS()
    a = int(a)
    b = int(b)

    if op == '+':
        print(a + b)
    else:
        print(a - b)

if __name__ == '__main__':
    resolve()

Solution (Python):
a,op,b = input().split()
if op=='+':
  print(int(a)+int(b))
elif op=='-':
  print(int(a)-int(b))

Solution (Python):
print(eval(input()))

Solution (Python):
a = input()
print(eval(a))

Solution (Python):
a = input()
print(eval(a))

Solution (Python):
a,op,b = input().split()

a = int(a)
b = int(b)
ans = 0
if op=='+': ans = a+b
if op=='-': ans = a-b
print(ans)

Solution (Python):
print(eval(input()))

Solution (Python):
a, op, b = input().split()
a, b = int(a), int(b)
print(a + b if op == "+" else a - b)

Solution (Python):
def main(a,op,b):
  if op=='+':
    return int(a)+int(b)
  elif op=='-':
    return int(a)-int(b)
 
  
if __name__=='__main__':
  a,op,b=input().split()
  print(main(a,op,b))

Solution (Python):
a,b,c =map(str, input().split())
A = int(a)
C = int(c)
res = 0
if b == "+":
  res = A+C
else:
  res = A-C
print(res)

Solution (Python):
a,op,b = input().split()
print([int(a)+int(b),int(a)-int(b)][op=='-'])

Solution (Python):
A, op, B = input().split()
print(eval(A + op + B))

Solution (Python):

a = input()
print(eval(a))

Solution (Python):
lis = input().split()
if lis[1] == "+":
    print(int(lis[0]) + int(lis[2]))
else:
    print(int(lis[0]) - int(lis[2]))

Solution (Python):


a = input()
print(eval(a))

Solution (Python):



from fractions import gcd
from itertools import combinations,permutations,accumulate 

from collections import deque,defaultdict,Counter
import decimal
import re











import sys
sys.setrecursionlimit(10000000)
mod = 10**9 + 7

def readInts():
  return list(map(int,input().split()))
def I():
  return int(input())
a,op,b = input().split()
if op == '+':
    print(int(a) + int(b))
else:
    print(int(a) - int(b))

Solution (Python):
A, op, B = input().split()
if op == '+':
    ans = int(A) + int(B)
else:
    ans = int(A) - int(B)
print(ans)

Solution (Python):
a,o,b = input().split()
a,b = int(a),int(b)
if o=='+':
    print(a+b)
else:
    print(a-b)

Solution (Python):
A,op,B = input().split()
print(eval(A+op+B))

Solution (Python):
s = input()
print(eval(s))

Solution (Python):
a, op, b = input().split()
a = int(a)
b = int(b)
if op == '+':
    print(a + b)
else:
    print(a - b)

Solution (Python):
A,op,B=input().split()
if op=="+":
    print(int(A)+int(B))
else:
    print(int(A)-int(B))

Solution (Python):
inputs = list(map(str,input().split()))
a=int(inputs[0])
b=int(inputs[2])
if inputs[1]=="-":
    print(a-b)
else:
    print(a+b)

Solution (Python):
a,op,b=input().split()

a=int(a)
b=int(b)

if op=='+':
    print(a+b)

elif op=='-':
    print(a-b)

Solution (Python):
a,b,c = input ().split ()
a = int (a)
c = int (c)
if b == '+':
  print (a+c)
else:
  print (a-c)

Solution (Python):
A,op,B=map(str,input().split())
a=A+op+B
print(eval(a))

Solution (Python):
a, os, b = input().split()
if os == '+':
    print(int(a)+int(b))
else:
    print(int(a)-int(b))

Solution (Python):
a,o,b=input().split();print(int(a)+int(b)*[-1,1][o=='+'])

Solution (Python):
print(eval(input()))

Solution (Python):
print(eval(input()))

Solution (Python):
a, op, b = input().split()

if op=='+':
    print(int(a)+int(b))
else:
    print(int(a)-int(b))

Solution (Python):
a, op, b = input().split()
print(int(a)+int(b) if op == '+' else int(a)-int(b))

Solution (Python):
s = input().split()
if s[1] == '+':
  print(int(s[0]) + int(s[2]))
else:
  print(int(s[0]) - int(s[2]))

Solution (Python):
s = input()
print(eval(s))

Solution (Python):
a,b,c = input().split()
if b == "+":
    print(int(a) + int(c))
else:
    print(int(a) - int(c))

Solution (Python):
a,o,b = list(input().split())

if (o == '+'):
    print(int(a)+int(b))
else:
    print(int(a)-int(b))

Solution (Python):
print(eval(input()))

Solution (Python):
a, op, b = map(str, input().split())
if op == '+':
    print(int(a)+int(b))
else:
    print(int(a)-int(b))

Solution (Python):
a, op, b = input().split()

if op == '+':
    print(int(a) + int(b))
else:
    print(int(a) - int(b))

Solution (Python):
print(eval(input()))

Solution (Python):
A, op, B = input().split()
ans = 0
if op == "+":
  ans = int(A) + int(B)
else:
  ans = int(A) - int(B)
print(ans)

Solution (Python):
import sys
import numpy as np
import random
from decimal import Decimal
import itertools
import re
import bisect
from collections import deque, Counter
from functools import lru_cache

sys.setrecursionlimit(10**9)
INF = 10**13
def LI(): return list(map(int, sys.stdin.buffer.readline().split()))
def I(): return int(sys.stdin.buffer.readline())
def LS(): return sys.stdin.buffer.readline().rstrip().decode('utf-8').split()
def S(): return sys.stdin.buffer.readline().rstrip().decode('utf-8')
def IR(n): return [I() for i in range(n)]
def LIR(n): return [LI() for i in range(n)]
def SR(n): return [S() for i in range(n)]
def LSR(n): return [LS() for i in range(n)]
def SRL(n): return [list(S()) for i in range(n)]
def MSRL(n): return [[int(j) for j in list(S())] for i in range(n)]
def SERIES(n): return np.fromstring(sys.stdin.buffer.read(), dtype=np.int32, sep=' ')
def GRID(h,w): return np.fromstring(sys.stdin.buffer.read(), dtype=np.int32, sep=' ').reshape(h,-1)[:,:w]
def GRIDfromString(h,w): return np.frombuffer(sys.stdin.buffer.read(), 'S1').reshape(h,-1)[:,:w]
MOD = 1000000007

def main():
	print(eval(S()))


if __name__ == '__main__':
    main()

Solution (Python):
print(eval(input()))

Solution (Python):
s = input()

print(eval(s))

Solution (Python):
a, op, b = input().split()
if op == '+':
  print(int(a) + int(b))
else:
  print(int(a) - int(b))

Solution (Python):
a,op,b=input().split()
a=int(a)
b=int(b)
if op=="+":
  print(a+b)
else:
  print(a-b)

Solution (Python):
a,b,c=map(str,input().split())
print(int(a)+int(c) if b=='+' else int(a)-int(c))

Solution (Python):
a, c, b = input().split()
a = int(a)
b = int(b)
if c == "+":
    print(a + b)
if c == "-":
    print(a -b)

Solution (Python):
a, op, b = input().split()
print(eval(a+op+b))

Solution (Python):
s = list(map(str,input().split()))
ans = 0
if s[1]=='+':
  ans = int(s[0])+int(s[2])
else:
  ans = int(s[0])-int(s[2])
print(ans)

Solution (Python):
a, op, b = input().split()
if op == "+":
  print(int(a) + int(b))
else:
  print(int(a) - int(b))

Solution (Python):
a, op, b = input().split()
a = int(a)
b = int(b)

if op == "+":
    print(a + b)
elif op == "-":
    print(a - b)

Solution (Python):
o,p,q = map(str, input().split())
a = int(o);b=int(q)
print(a+b if p == "+" else a-b)

Solution (Python):
a,s,b = (input().split())
a1 = int(a)
b1 = int(b)
if(s == "+"):
    print(int(a1 + b1))
else:
    print(int(a1 - b1))

Solution (Python):
A,op,B = input().split()

a = int(A)
b = int(B)

if op == "+":
    print(a+b)
else:
    print(a-b)

Solution (Python):
a, b, c = map(str, input().split())

if b == '+':
  print(int(a) + int(c))
else:
  print(int(a) - int(c))

Solution (Python):
exec('print(' + input() + ')')

Solution (Python):
A,op,B = input().rstrip().split(" ")
if op == "+":
    print(int(A) + int(B))
else:
    print(int(A) - int(B))

Solution (Python):
print(eval(input()))

Solution (Python):
a,op,b=input().split()
a=int(a)
b=int(b)
if op=="+":
  print(a+b)
if op=="-":
  print(a-b)

Solution (Python):
print(eval(input()))

Solution (Python):
ABC = input().split()
A, B, C = int(ABC[0]), str(ABC[1]), int(ABC[2])

if ABC[1] == "+":
    print("{}".format(A+C))
    
elif ABC[1] == "-":
    print("{}".format(A-C))

Solution (Python):
A,op,B = list(input().split())


ans = A + op + B
print(eval(ans))

Solution (Python):
A, op, B = map(str, input().split())
C = A + op + B
print(eval(C))

Solution (Python):
a,op,b = input().split()
if op == "+":
    print(int(a)+int(b))
else:
    print(int(a)-int(b))

Solution (Python):
from fractions import gcd
from collections import Counter, deque, defaultdict
from heapq import heappush, heappop, heappushpop, heapify, heapreplace, merge
from bisect import bisect_left, bisect_right, bisect, insort_left, insort_right, insort
from itertools import accumulate, product, permutations, combinations

def main():
    A, op, B = input().split()

    print(int(A) + int(B)) if op == '+' else print(int(A) - int(B))

if __name__ == '__main__':
    main()

Solution (Python):
a , op , b = input().split()
if op == '+':
  print(int(a) + int(b))
else:
  print(int(a) - int(b))

Solution (Python):
a, op, b = input().split()
if op == '+':
  print(int(a)+int(b))
else:
  print(int(a)-int(b))

Solution (Python):
A, op, B = input().split()

a = int(A)
b = int(B)

if (op == "+"):

    c = a + b

else:
    c = a - b

print(c)

Solution (Python):
def actual(A, op, B):
    if op == '+':
        return A + B

    return A - B

A, op, B = input().split()
A, B = int(A), int(B)

print(actual(A, op, B))

Solution (Python):




print(eval(input()))

Solution (Python):
import bisect,collections,copy,heapq,itertools,math,string
import sys
def S(): return sys.stdin.readline().rstrip()
def M(): return map(str,sys.stdin.readline().rstrip().split())
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LS(): return list(sys.stdin.readline().rstrip().split())
a, x, b = M()
if x == '+':
    print(int(a)+int(b))
else:
    print(int(a)-int(b))

Solution (Python):
def main():
    s = input().split(' ')
    if s[1] == '+':
        print(int(s[0]) + int(s[2]))
    else:
        print(int(s[0]) - int(s[2]))
main()

Solution (Python):


import math; from collections import *
import sys; from functools import reduce

def get_ints(): return map(int, input().strip().split())
def get_list(): return list(get_ints())
def getlistofstring(): return list(input().strip().split())
def printxsp(*args): return print(*args, end="")
def printsp(*args): return print(*args, end=" ")

UGLYMOD = int(1e9)+7; SEXYMOD = 998244353; MAXN = int(1e5)





li = getlistofstring()
if li[1] == '+':
    print(int(li[0])+int(li[2]))
else:
    print(int(li[0])-int(li[2]))
'''
>>> COMMENT THE STDIN!! CHANGE ONLINE JUDGE !!
THE LOGIC AND APPROACH IS MINE @luctivud ( UDIT GUPTA )
Link may be copy-pasted here if it's taken from other source.
DO NOT PLAGIARISE.
>>> COMMENT THE STDIN!! CHANGE ONLINE JUDGE !!
'''

Solution (Python):
print(eval(input()))

Solution (Python):
print(eval(input()))

Solution (Python):
a,op,b=input().split();print([int(a)+int(b),int(a)-int(b)][op=='-'])

Solution (Python):
siki = input().split()
A = int(siki[0])
B = int(siki[2])

print(A + B if siki[1] == "+" else A - B)

Solution (Python):
print(eval(input()))

Solution (Python):
lst = list(map(str,input().split()))
if lst[1] == '+':
    print(int(lst[0])+int(lst[2]))
else:
    print(int(lst[0])-int(lst[2]))

Solution (Python):
exec("print("+input()+")")

Solution (Python):
s = list(input().split())

if s[1] == '+':
  print(int(s[0]) + int(s[2]))
else:
  print(int(s[0]) - int(s[2]))

Solution (Python):
print(eval(input()))

Solution (Python):
formula = ''.join(list(input().split()))
print(eval(formula))

Solution (Python):
A, op, B = map(str, input().split(' '))

if '+' == op:
    print(int(A) + int(B))
else:
    print(int(A) - int(B))

Solution (Python):
t = input().split()
a = int(t[0])
b = int(t[2])

if t[1] == "+":
    c = a + b
    print(c)
else:
    c = a - b
    print(c)

Solution (Python):
s = input()
print(eval(s))

Solution (Python):


"""
int 
float 


a=input()
a,b=map(int,input().split()) 

print(a)
ptrint("Hello")

for name in fruits: 
    print(name)

list0 = [] 
list0 = [1,2,3,4] 
list0 = [0]*10 
list1 = list(map(int, input().split()))　
list1 = list1 + [6, 7, 8] 
list2.append(34) 
list.insert(3,10) 
len(list4) 
max(sa) 
list5.count(2) 
abs(a) 
max(a,b) min(a,b) 

extension_1 = []
for i in range(10):
    extension_1.append(i)
extension_1


comprehension_1= [i for i in range(10)]
comprehension_1

"""
a,b,c= input().split()
a=int(a)
c=int(c)
if b=="+":
    print(a+c)
else:
    print(a-c)

Solution (Python):
c=list(input().split())
if c[1] =='+':
  print(int(c[0])+int(c[2]))
else:
  print(int(c[0])-int(c[2]))

Solution (Python):
a, op, b = input().split()
if(op == "+"):
    print(int(a)+int(b))
else:
    print(int(a)-int(b))

Solution (Python):
a,op, b = input().split()

a = int(a)
b = int(b)

if op == "+":
    print(a + b)
else:
    print(a-b)

Solution (Python):
print(eval(input()))

Solution (Python):

import sys

sys.setrecursionlimit(10 ** 7)
input = sys.stdin.readline
f_inf = float('inf')
mod = 10 ** 9 + 7


def resolve():
    fomula = input()
    print(eval(fomula))


if __name__ == '__main__':
    resolve()

Solution (Python):
A,op,B = input().split()

if op == '+':
    print(int(A)+int(B))
else:
    print(int(A)-int(B))

Solution (Python):
A,op,B=input().split()
if op=="+":
  print(int(A)+int(B))
else:
  print(int(A)-int(B))

Solution (Python):
A,op,B=input().split()

if op=='+':
  print(int(A)+int(B))
else:
  print(int(A)-int(B))

Solution (Python):
a,b,c=input().split()
print(int(a)+int(c) if b=="+" else int(a)-int(c))

Solution (Python):
a, op, b = input().split()
a = int(a)
b = int(b)
if op == '+':
    print(a+b)
else:
    print(a-b)

Solution (Python):
a,b,c = map(str, input().split())
if (b=="+"):
    print(int(a)+int(c))
else:
    print(int(a)-int(c))

Solution (Python):
f = input().replace(' ', '')
print(eval(f))

Solution (Python):
A,op,B = input().split()
if op == '+':
    print(int(A)+int(B))
else:
    print(int(A)-int(B))

Solution (Python):
a, op, b = input().split()
print(eval(a + op + b))

Solution (Python):
a, op, b = input().split()
a = int(a)
b = int(b)

if op == '+':
  print(a+b)
elif op == '-':
  print(a-b)

Solution (Python):
a, op, b = input().split()
a = int(a)
b = int(b)

if op == '+':
  print(a+b)
elif op == '-':
  print(a-b)

Solution (Python):



A, op, B = input().split()

A = int(A)
B = int(B)

answer = 0
if op == '+':
    answer = A+B
else:
    answer = A-B

print(answer)

Solution (Python):
a,o,b=input().split();print(eval(a+o+b))

Solution (Python):
A, op, B = input().split()

a = int(A)
b = int(B)

if op == '+':
  print(a + b)
else:
  print(a - b)

Solution (Python):
ns=input()
nsl=ns.split(' ')

if nsl[1]=='+':
  print(int(nsl[0])+int(nsl[2]))
else:
  print(int(nsl[0])-int(nsl[2]))

Solution (Python):
a, b, c = map(str, input().split())
if(b == "+"):
  print(int(a) + int(c))
else:
  print(int(a) - int(c))

Solution (Python):
a, op, b = map(str, input().split())
if op == "+":
    print(int(a) + int(b))
else:
    print(int(a) - int(b))

Solution (Python):
a  = input().split()
if a[1] == '+':
    print(int(a[0])+int(a[2]))
else:
    print(int(a[0])-int(a[2]))

Solution (Python):
A, op, B = list(map(str, input().split()))
if op == "-":
  print(int(A) - int(B))
else:
  print(int(A) + int(B))

Solution (Python):
a, op, b = map(str, input().split())
if op=='+': print(int(a)+int(b))
else: print(int(a)-int(b))

Solution (Python):
a,op,b=input().split()
if op=='+':
    print(int(a)+int(b))
else:
    print(int(a)-int(b))

Solution (Python):
A,pm,B = input().split()

a = int(A)
b = int(B)
if pm == "+":
  print(a+b)
else:
  print(a-b)

Solution (Python):
A,op,B=map(str,input().split())

if op=='+':
  print(int(A)+int(B))
else:
  print(int(A)-int(B))

Solution (Python):
a,op,b=input().split()
a=int(a)
b=int(b)
if op=='+':
    print(a+b)
else:
    print(a-b)

Solution (Python):
a, op, b = input().split()
if op == '+':
  print(int(a) + int(b))
else:
  print(int(a) - int(b))

Solution (Python):
A, op, B = input().split()
A = int(A)
B = int(B)
if op == '+':
  print(A + B)
else:
  print(A - B)

Solution (Python):
a,o,b = input().split()
a = int(a)
b = int(b)
if o == "+":
    print(a+b)
else:
    print(a-b)

Solution (Python):
a, op, b = input().split()
a = int(a)
b = int(b)
if op == '+':
    print(a+b)
else:
    print(a-b)

Solution (Python):
A,op,B = input().split()
A = int(A)
B = int(B)
if op == '+':
    print(A + B)
else:
    print(A - B)

Solution (Python):
a,op,b=input().split()
if(op == "+"):
    print(int(a)+int(b))
elif(op == "-"):
    print(int(a)-int(b))

Solution (Python):
print(eval(input()))

Solution (Python):
A, B, C = map(str, input().split())
print(int(A)+int(C) if B=="+" else int(A)-int(C))

Solution (Python):
a, op, b = map(str, input().split())
if op == "+":
    print(int(a)+int(b))
else:
    print(int(a)-int(b))

Solution (Python):
A,op,B = input().split()

if op == "+":
  print(int(A)+int(B))
else:
  print(int(A)-int(B))

Solution (Python):
s = input().split()
if s[1] == "+":
    print(int(s[0]) + int(s[2]))
else:
    print(int(s[0]) - int(s[2]))

Solution (Python):
print(eval(input()))

Solution (Python):
l = input()
col = l.split(' ')
a = int(col[0])
op = col[1]
b = int(col[2])

if 1 <= a <= 10 ** 9 and 1 <= b <= 10 ** 9:
  if op == '+':
    print(a + b)
  elif op == '-':
    print(a - b)

Solution (Python):
a,op,b=input().split()
if op=='+':
  print(int(a)+int(b))
else:
  print(int(a)-int(b))

Solution (Python):
a, op, b = input().split()

if op == '+':
    ans = int(a) + int(b)
else:
    ans = int(a) - int(b)

print(ans)

Solution (Python):
a, op, b = input().split()
print(int(a)+int(b) if op == '+' else int(a)-int(b))

Solution (Python):
A,op,B = map(str,input().split())
if op =="+":
    print(int(A)+int(B))
elif op =="-":
    print(int(A)-int(B))

Solution (Python):
inputs = list(input().split())
a, op, b = int(inputs[0]), inputs[1], int(inputs[2])

print(a + b if op == '+' else a - b)

Solution (Python):
a, op, b = input().split()
if op == '+':
    print(int(a) + int(b))
else:
    print(int(a) - int(b))

Solution (Python):
a,op,b=input().split()
a=int(a)
b=int(b)
if op=="+":
    print(a+b)
else:
    print(a-b)

Solution (Python):
s=input()
a = eval(s)
print(a)

Solution (Python):
a, op, b = input().split()

if op == '+':
    print(int(a)+int(b))
else:
    print(int(a)-int(b))

Solution (Python):
a,o,b=map(str,input().split())
a=int(a)
b=int(b)
if o == '+':
  print(a+b)
else:
  print(a-b)

Solution (Python):

a,op,b = map(str, input().split())
a = int(a)
b = int(b)
if op == '+':
  print(a+b)
else:
  print(a-b)

Solution (Python):
A, op, B = input().split()

if op == '+':
  print(int(A) + int(B))
else:
  print(int(A) - int(B))

Solution (Python):
a,b,c=(str(x) for x in input().split())
if b=='+':
    print(int(a)+int(c))
elif b=='-':
    print(int(a)-int(c))

Solution (Python):
l = input()
print(eval(l))

Solution (Python):

siki=input()
print(eval(siki))

Solution (Python):
a,b,c = input().split()
if b == "+":
    print(int(a)+int(c))
else:
    print(int(a)-int(c))

Solution (Python):
x = input().split()
a = int(x[0])
b = int(x[2])
if x[1] == '+':
  print(a+b)
else:
  print(a-b)

Solution (Python):
x = input().split()
a = int(x[0])
b = int(x[2])
if x[1] == '+':
  print(a+b)
else:
  print(a-b)

Solution (Python):
a, b, c = input().split()
print(int(a) + int(c) if b == "+" else int(a) - int(c))

Solution (Python):
a,op,b=input().split()
a=int(a)
b=int(b)
if op=='+':
    print(a+b)
else:
    print(a-b)

Solution (Python):
a,o,b=map(str,input().split())
a=int(a)
b=int(b)
if o=='+':
    print(a+b)
else:
    print(a-b)

Solution (Python):
a,op,b = input().split()
if op=='+':
    print(int(a)+int(b))
else:
    print(int(a)-int(b))

Solution (Python):
x,cal,y = input().split()
print(int(x)+int(y) if cal == '+' else int(x)-int(y))

Solution (Python):
a = list(input().split())
if a[1]=='+':
  print(int(a[0]) + int(a[2]))
else:
  print(int(a[0]) - int(a[2]))

Solution (Python):
print(eval(input()))

Solution (Python):
a,op,b = input().split()
if op=='+':
    print(int(a)+int(b))
else:
    print(int(a)-int(b))

Solution (Python):
a,o,b=input().split()
a=int(a)
b=int(b)
print(a+b if o=="+" else a-b)

Solution (Python):
print(eval(input()))

Solution (Python):
print(eval(input()))

Solution (Python):


import sys






























def main():
    mod = 1000000007                
    inf = float('inf')              
    
    sys.setrecursionlimit(10**6)    
    def input(): return sys.stdin.readline().rstrip()
    def ii():    return int(input())
    def mi():    return map(int, input().split())
    def mi_0():  return map(lambda x: int(x)-1, input().split())
    def lmi():   return list(map(int, input().split()))
    def lmi_0(): return list(map(lambda x: int(x)-1, input().split()))
    def li():    return list(input())
    
    
    a, op, b = input().split()
    print(eval(a+op+b))


if __name__ == "__main__":
    main()

Solution (Python):
s = input()
print(eval(s))

Solution (Python):
x, y, z = input().split()
if y == "+":
    print(int(x)+int(z))
else:
    print(int(x)-int(z))

Solution (Python):
a,b,c=[int(i)if i.isdigit() else i for i in input().split()]
print(a+c if b=="+" else a-c)

Solution (Python):
from sys import stdin
def LS(): return list(stdin.readline().rstrip().split())

l = LS()
ans = 0
if l[1] == '+':
    ans = int(l[0])+int(l[2])
else:
    ans = int(l[0])-int(l[2])
    
print(ans)

Solution (Python):

import sys
sys.setrecursionlimit(10**9)
INF=10**18
MOD=10**9+7
input=lambda: sys.stdin.readline().rstrip()
YesNo=lambda b: bool([print('Yes')] if b else print('No'))
YESNO=lambda b: bool([print('YES')] if b else print('NO'))
int1=lambda x:int(x)-1

def main():
    print(eval(input().replace(' ','')))

if __name__ == '__main__':
    main()

Solution (Python):

a, op,  b = map(str, input().split())
if op =="+":
    print(int(a)+int(b))
else:
    print(int(a)-int(b))

Solution (Python):
A, op, B = input().split()
print(eval(A+op+B))

Solution (Python):
a = eval(input())
print(a)

Solution (Python):
a, b, c = input().split()

a = int(a)
c = int(c)

if b == "+":
    print(a + c)
else:
    print(a - c)

Solution (Python):
s = input().split()
if s[1] == "+":
    print(int(s[0]) + int(s[2]))
else:
    print(int(s[0]) - int(s[2]))

Solution (Python):
a, op, b = input().split()
if op == '+':
  print(int(a)+int(b))
else:
  print(int(a)-int(b))

Solution (Python):
a,op,b=input().split()
print(eval(a+op+b))

Solution (Python):
print(eval(input()))

Solution (Python):
a, op, b = input().split()

a = int(a)
b = int(b)

if op == '+':
    print(a + b)
else:
    print(a - b)

Solution (Python):
a,op,b = map(str, input().split())
a = int(a)
b = int(b)
if op == '+':
    print(a+b)
else:
    print(a-b)

Solution (Python):
A,op,B=map(str,input().split())
if op=="+":
    print (int(A)+int(B))
else:
    print (int(A)-int(B))

Solution (Python):
A,op,B = input().split()
if op=='+':
    print(int(A)+int(B))
else:
    print(int(A)-int(B))

Solution (Python):
A,op,B=input().split()
if op=="+":
  print(int(A)+int(B))
else:
  print(int(A)-int(B))

Solution (Python):
A, op , B = map(str, input().split())
print(eval(A + op + B))

Solution (Python):
a,op,b=input().split()
a=int(a)
b=int(b)

if op=="+":
  print(a+b)
else:
  print(a-b)

Solution (Python):








print(eval(input()))

Solution (Python):
A,op,B = input().split()
A = int(A)
B = int(B)
if op =="+":
  print(A+B)
else:
  print(A-B)

Solution (Python):
def main():
 str =input().split()
 if str[1] =='+' :
  print(int(str[0])+int(str[2]))
 else :
  print(int(str[0])-int(str[2]))
  
main()

Solution (Python):
A, op, B = input().split()
A = int(A)
B = int(B)
if op == "-":
    print(A-B)
else:
    print(A+B)

Solution (Python):
n = input().split()
if(n[1] == "+"): print(int(n[0]) + int(n[2]))
else: print(int(n[0]) - int(n[2]))

Solution (Python):
argList = input().split()

if argList[1] == '+':
    print(str(int(argList[0])+int(argList[2])))
elif argList[1] == '-':
    print(str(int(argList[0])-int(argList[2])))

Solution (Python):
A,op,B =map(str,input().split())
if op == '+':
    print(int(A)+int(B))
elif op =='-':
    print(int(A)-int(B))

Solution (Python):
A, op, B = input().split()
if op == '+':
    print(int(A) + int(B))
elif op == '-':
    print(int(A) - int(B))

Solution (Python):
A, Op, B = map(str, input().split())

def Main(A, Op, B):
    a = int(A)
    b = int(B)
    if Op == "+":
        return a+b
    if Op == '-':
        return a-b

print(Main(A, Op, B))

Solution (Python):
print(eval(input()))

Solution (Python):
def main():
    AopB = input()
    ans = eval(AopB)
    print(ans)


if __name__ == "__main__":
    main()

Solution (Python):
a,s,b=input().split()
a,b=map(int,[a,b])
if s=="+":
  print(a+b)
else:
  print(a-b)

Solution (Python):
a, op, b = input().split()
a, b = int(a), int(b)

if op == '+':
    print(a+b)
else:
    print(a-b)

Solution (Python):
a, op, b = input().split()
a = int(a)
b = int(b)

[print(a+b) if op == '+' else print(a-b)]

Solution (Python):






import sys
input = sys.stdin.readline

import math
from collections import deque
from fractions import gcd
from functools import lru_cache






MOD = 10**9+7
INF = float('inf')






def inputI(): return int(input().strip())
def inputS(): return input().strip()
def inputIL(): return list(map(int,input().split()))
def inputSL(): return list(map(str,input().split()))
def inputILs(n): return list(int(input()) for _ in range(n))
def inputSLs(n): return list(input().strip() for _ in range(n))
def inputILL(n): return [list(map(int, input().split())) for _ in range(n)]
def inputSLL(n): return [list(map(str, input().split())) for _ in range(n)]


def inv(n): return pow(n, MOD-2, MOD)


kaijo_memo = []
def kaijo(n):
  if(len(kaijo_memo) > n):
    return kaijo_memo[n]
  if(len(kaijo_memo) == 0):
    kaijo_memo.append(1)
  while(len(kaijo_memo) <= n):
    kaijo_memo.append(kaijo_memo[-1] * len(kaijo_memo) % MOD)
  return kaijo_memo[n]

gyaku_kaijo_memo = []
def gyaku_kaijo(n):
  if(len(gyaku_kaijo_memo) > n):
    return gyaku_kaijo_memo[n]
  if(len(gyaku_kaijo_memo) == 0):
    gyaku_kaijo_memo.append(1)
  while(len(gyaku_kaijo_memo) <= n):
    gyaku_kaijo_memo.append(gyaku_kaijo_memo[-1] * pow(len(gyaku_kaijo_memo),MOD-2,MOD) % MOD)
  return gyaku_kaijo_memo[n]

def nCr(n,r):
  if(n == r):
    return 1
  if(n < r or r < 0):
    return 0
  ret = 1
  ret = ret * kaijo(n) % MOD
  ret = ret * gyaku_kaijo(r) % MOD
  ret = ret * gyaku_kaijo(n-r) % MOD
  return ret


def factorization(n):
    arr = []
    temp = n
    for i in range(2, int(-(-n**0.5//1))+1):
        if temp%i==0:
            cnt=0
            while temp%i==0:
                cnt+=1
                temp //= i
            arr.append([i, cnt])
    if temp!=1:
        arr.append([temp, 1])

    if arr==[]:
        arr.append([n, 1])
    return arr


def lcm(a, b):
    return a * b // gcd (a, b)





s = inputSL()

if s[1]=="+":
  print(int(s[0])+int(s[2]))
else:
  print(int(s[0])-int(s[2]))

Solution (Python):
a, op, b = input().split()

print(eval(a+op+b))

Solution (Python):
a, op, b = input().split()
a = int(a)
b = int(b)
if op == '+':
    print(a + b)
else:
    print(a - b)

Solution (Python):
A,B,C=map(str,input().split())
if B=="+":
  print(int(A)+int(C))
else:
  print(int(A)-int(C))

Solution (Python):
import sys
import math
import bisect

def main():
    a, op, b = input().split()
    a = int(a)
    b = int(b)
    if op == '+':
        print(a + b)
    else:
        print(a - b)

if __name__ == "__main__":
    main()

Solution (Python):

A, op, B = map(str, input().split())
print(int(A) + int(op + B))