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, 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)
print([A + B, A - B][op == '-'])

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

if op == "+":
    result = a + b
else:
    result = a - b

print(result)

Solution (Python):
def iroha():
    a, op, b = map(str, input().split())
    a = int(a)
    b = int(b)

    if op == "+":
        result = a + b
    else:
        result = a - b

    print(result)




if __name__ == "__main__":
    iroha()

Solution (Python):
s = list(input().split())
print(eval("".join(s)))

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

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

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

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

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

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

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

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

Solution (Python):
'''
ABC050 A - Addition and Subtraction Easy
https://atcoder.jp/contests/abc050/tasks/abc050_a
'''
def main():
    a, op, b = input().split()
    a, b = int(a), int(b)

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


main()

Solution (Python):
'''
ABC050 A - Addition and Subtraction Easy
https://atcoder.jp/contests/abc050/tasks/abc050_a
'''
def main():
    a, op, b = input().split()
    a, b = int(a), int(b)

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

if __name__ == '__main__':
    main()

Solution (Python):
'''
ABC050 A - Addition and Subtraction Easy
https://atcoder.jp/contests/abc050/tasks/abc050_a
'''
a, op, b = input().split()
a, b = int(a), int(b)

if op == '+':
    ans = a+b
elif op == '-':
    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):

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

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

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=map(str,input().split())
a=int(a)
c=int(c)
if b=='+':print(a+c)
else:print(a-c)

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

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

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

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

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 = input().split()
A,B = int(A),int(B)
print(A + B if op == "+" else 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):
a,op,b = map(str,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()
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))
elif op == '-':
    print(int(a) - int(b))

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

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


if __name__ == '__main__':
    main()

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 = input().split()
if op == '+':
    print(int(a) + int(b))
else:
    print(int(a) - int(b))

Solution (Python):
L = list(map(str, input().split()))

if L[1] == '+':
    print(int(L[0]) + int(L[2]))
else:
    print(int(L[0]) - int(L[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 = list(map(str, input().split()))
if op == '+':
    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):
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 == '+':
    ans = int(a) + int(b)
else:
    ans = int(a) - int(b)
print(ans)

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

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

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

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

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


if __name__ == "__main__":
    main()

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


if __name__ == "__main__":
    main()

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

Solution (Python):
def solve():
    print(eval(input().replace(' ','')))


if __name__ == "__main__":
    solve()

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

Solution (Python):

data= list(input().split())
if data[1]=='+':
    print(int(data[0])+int(data[2]))
elif data[1]=='-':
    print(int(data[0])-int(data[2]))

Solution (Python):

A, op, B = input().split()
A = int(A)
B = int(B)
if (1 <= A & A <= 10 ** 9) & (1 <= B & B <= 10 ** 9) & ((op == '+') | (op == '-')):
    if op == '+':
        result = A + B
    elif op == '-':
        result = A - B
    print(result)

Solution (Python):
import sys

readline = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)


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

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


if __name__ == '__main__':
    main()

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

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

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())
a = int(a)
b = int(b)

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

Solution (Python):
s = input()

if '+' in s:
    index = s.index('+')
    print(int(s[:index])+int(s[index+1:]))
else:
    index = s.index('-')
    print(int(s[:index])-int(s[index+1:]))

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, b = int(a), int(b)
print(a+b if op=='+' else a-b)

Solution (Python):
print(eval(input()))
"""
import os
import sys
import random
import numpy as np
import scipy.stats as stats
import matplotlib as mpl;mpl.use('TkAgg')
import matplotlib.pyplot as plt

mpl.rcParams['axes.xmargin'] = 0
mpl.rcParams['axes.ymargin'] = 0
plt.rcParams['figure.figsize'] = (14, 7)


class Bingo:
    
    def __init__(self):
        self.li = []  
        self.bingo = [[0 for i in range(5)] for j in range(5)]  
        self.bingo_state = [[0 for i in range(5)] for j in range(5)]  
        self.lot = []  
        self.num = list(range(1, 76, 1))  
        self.counter = 0  
        self.latest_i = 0  
        self.latest_j = 0  
        self.flag = 0  

    
    def __decision(self):
        while len(self.li) < 25:  
            rnd = random.randint(1, 75)  
            if self.li.count(rnd) == 0:  
                self.li.append(rnd)
            if len([j for j in self.li if j <= 15 and not j <= 0]) > 5 \
                    or len([j for j in self.li if j <= 30 and not j <= 15]) > 5 \
                    or len([j for j in self.li if j <= 45 and not j <= 30]) > 5 \
                    or len([j for j in self.li if j <= 60 and not j <= 45]) > 5 \
                    or len([j for j in self.li if j <= 75 and not j <= 60]) > 5:
                self.li.remove(rnd)
        self.li.sort()

    
    def set(self):
        self.__decision()
        index = 0
        for i in range(5):
            for j in range(5):
                if i == 2 and j == 2:
                    self.bingo[j][i] = 'free'
                    index += 1
                else:
                    self.bingo[j][i] = str(self.li[index])
                    index += 1
        self.bingo_state[2][2] = 1
        self.li.pop(12)

    
    def __lottery(self):
        rnd = self.num[random.randint(0, len(self.num) - 1)]
        self.num.remove(rnd)
        self.lot.append(rnd)

    
    def __judge(self):
        
        self.__lottery()
        number = self.lot[-1]
        if self.li.count(number) == 1:
            for i in range(5):
                for j in range(5):
                    if self.bingo[i][j] == str(number):
                        self.bingo_state[i][j] = 1
                        self.counter += 1
                        self.latest_i = i
                        self.latest_j = j
                        break
                else:
                    continue
                break
            if self.counter >= 4:
                

                
                for i in range(5):
                    if self.bingo_state[i][self.latest_j] == 0:
                        break
                    elif i == 4:
                        self.flag = 1

                
                if self.flag == 0:
                    for j in range(5):
                        if self.bingo_state[self.latest_i][j] == 0:
                            break
                        elif j == 4:
                            self.flag = 1

                
                if self.flag == 0:
                    if self.latest_i == self.latest_j:
                        for i in range(5):
                            if self.bingo_state[i][i] == 0:
                                break
                            elif i == 4:
                                self.flag = 1
                    elif self.latest_i + self.latest_j == 4:
                        ii = 0
                        jj = 4
                        for _ in range(5):
                            if self.bingo_state[ii][jj] == 0:
                                break
                            elif ii == 4 and jj == 0:
                                self.flag = 1
                            ii += 1
                            jj -= 1

    
    def get(self):
        while self.flag == 0:
            self.__judge()
        return len(self.lot)


def display(result):
    print('total=' + str(len(result)))
    print('max=' + str(np.max(result)))
    print('min=' + str(np.min(result)))
    print('average=' + str(np.mean(result)))
    print('median=' + str(np.median(result)))
    print('mode=' + str(stats.mode(result)))


def make_fig(result):
    fig = plt.figure()
    plt.title('BINGO', fontsize=20)
    plt.grid(True)
    plt.xticks(list(range(1, 75, 2)))
    plt.hist(result, bins=75, range=(1, 75), alpha=0.8, color='c')
    
    fig.savefig('hist.png')


def main():
    args = sys.argv  
    times = int(args[1])
    result = np.empty(0)

    for a in range(1, times + 1):
        if times >= 100:
            if a % int(times / 100) == 0:
                print(str(int(a * 100 / times)) + '%')
        bingo = Bingo()
        bingo.set()
        result = np.append(result, bingo.get())

    result.sort()
    make_fig(result)
    display(result)


if __name__ == '__main__':
    main()
"""

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

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

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

Solution (Python):



a, op, b = map(str, input().split())

result = eval(a + op + b)

print(int(result))

Solution (Python):

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


calc = eval(A + op + B)
print(int(calc))

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=map(str,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 = int(A)
B = int(B)

if op == '+':
    print(A + B)
else:
    print(A - 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):
print(eval(input()))

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())

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

if op == '+':
    print(A + B)

elif op == '-':
    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):
def calculate(a, b, op):
    if op == '+':
        return a + b
    else:
        return a - b


lst = list(map(str, input().split()))
print(calculate(int(lst[0]), int(lst[2]), lst[1]))

Solution (Python):









a, op, b = map(str,input().split())

input_a = int(a)
input_b = int(b)


result = 0
if op == "+":
    result = input_a + input_b
elif op == "-":
    result = input_a - input_b
else:
    result = "Error"

print(result)

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()
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 == "+":
    S = a + b
else:
    S = a - b

print(S)

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):
print(eval(input()))

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

Solution (Python):

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


if op == '+':
    S = A + B
else:
    S = A - B

print(S)

Solution (Python):





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

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

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

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

if op == "+":
    ans = A + B
else:
    ans = A - B

print(ans)

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):

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

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


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

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

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

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

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

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

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

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)
if op == '+':
  print(A+B)
else:
  print(A-B)

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

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

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

Solution (Python):


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

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

print(result)

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

a = int(l[0])
b = int(l[2])

if l[1] =='+': print(a+b) 
else: print(a-b)

Solution (Python):
a_num_str, operator, b_num_str = map(str, input().split())

a_num_int = int(a_num_str)
b_num_int = int(b_num_str)

if operator == "+" :
    sum_a_b = a_num_int + b_num_int
    print(sum_a_b)
elif operator == "-" :
    sum_a_b = a_num_int - b_num_int
    print(sum_a_b)

Solution (Python):




a, op, b = map(str, input().split())


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


print(answer)

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):

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


if op == '+':
    answer = a + b
elif op == '-':
    answer = a - b


print(answer)

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 = input().split()

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

if op == "+":
    print(A + B)
if op == "-":
    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()
print(int(A) + int(B) if op == '+' else int(A) - int(B))

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

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):
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 = 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(maxsplit=3))



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




if op == "+":
    answer = A + B
else:
    answer = A - B


print(answer)

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 = eval(input())
print(a)

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

Solution (Python):
import sys
def input(): return sys.stdin.readline().strip()

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):
s = input().split()
if s[1] == '+':
    print(int(s[0]) + int(s[2]))
else:
    print(int(s[0]) - int(s[2]))

Solution (Python):
import sys,bisect

from sys  import stdin,stdout

from bisect import bisect_left,bisect_right,bisect,insort,insort_left,insort_right

from math import gcd,ceil,floor,sqrt

from collections import Counter,defaultdict,deque,OrderedDict

from queue import Queue,PriorityQueue

from string import ascii_lowercase


sys.setrecursionlimit(10**6)
INF = float('inf')
MOD = 998244353
mod = 10**9+7

def isPrime(n):
    if (n <= 1) :return False
    if (n <= 3) :return True
    if (n%2 == 0 or n%3 == 0):return False
    for i in range(5,ceil(sqrt(n))+1,6):
        if (n%i==0 or n%(i+2)==0):
            return False
    return True

def st():
    return list(stdin.readline().strip())

def inp():
    return int(stdin.readline())

def li():
    return list(map(int,stdin.readline().split()))

def mp():
    return map(int,stdin.readline().split())

def pr(n):
    stdout.write(str(n)+"\n")
    
def DFS(dictionary,vertex,visited):
    visited[vertex]=True
    stack=[vertex]
    print(vertex)
    while stack:
        a=stack.pop()
        for i in dictionary[a]:
            if not visited[i]:
                print(i)
                visited[i]=True
                stack.append(i)


def BFS(dictionary, vertex,visited):
    visited[vertex]=True
    q=deque()
    q.append(vertex)
    while q:
        a=q.popleft()
        for i in dictionary[a]:
            if not visited[i]:
                visited[i]=True
                q.append(i)
                print(i)

                


def soe(limit):
    l=[1]*(limit+1)
    l[0]=0
    l[1]=0
    prime=[]
    for i in range(2,limit+1):
        if l[i]:
            for j in range(i*i,limit+1,i):
                l[j]=0
    
    for i in range(2,limit+1):
        if l[i]:
            prime.append(i)
    return prime

def segsoe(low,high):
    limit=int(high**0.5)+1
    prime=soe(limit)
    n=high-low+1
    l=[0]*(n+1)
    for i in range(len(prime)):
        lowlimit=(low//prime[i])*prime[i]
        if lowlimit<low:
            lowlimit+=prime[i]
        if lowlimit==prime[i]:
            lowlimit+=prime[i]
        for j in range(lowlimit,high+1,prime[i]):
            l[j-low]=1
    for i in range(low,high+1):
        if not l[i-low]:
            if i!=1:
                print(i)
                
def gcd(a,b):
    while b:
        a=a%b
        b,a=a,b
    return a

def power(a,n):
    r=1
    while n:
        if n&1:
            r=(r*a)
        a*=a
        n=n>>1
    return r
            
    
def solve():
    s=input().split()
    if s[1]=='+':
        pr(int(s[0])+int(s[2]))
    else:
        pr(int(s[0])-int(s[2]))



for _ in range(1):
    solve()

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())
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):

print(eval(input()))

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

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

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):
l = list(input().split())
a = int(l[0])
b = int(l[2])
if l[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)
else:
    print(A - B)

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

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

Solution (Python):

a_num_str, operator, b_num_str = map(str, input().split())


a_num_int = int(a_num_str)
b_num_int = int(b_num_str)


if operator == '+':
    sum_a_b = a_num_int + b_num_int
    print(sum_a_b)
elif operator == '-':
    sub_a_b = a_num_int - b_num_int
    print(sub_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 == '+':
	ans = int(a)+int(b)
else:
	ans = int(a)-int(b)
print(ans)

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

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

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

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,b,c=map(str,input().split())
a=int(a)
c=int(c)
if b=="+":
  print(a+c)
else:
  print(a-c)

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

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):
x = input()
y = x.split(' ')
if y[1] == '+':
  print(int(y[0]) + int(y[2]))
else:
  print(int(y[0]) - int(y[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):
import sys
s = input()
print(eval(s))

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

a = int(s[0])
b = int(s[2])

if s[1] == '+':
    print(a + b)
else:
    print(a - 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()
a = int(a)
b = int(b)
if op == "+":
  print(a+b)
else:
  print(a-b)

Solution (Python):

def main():
    a, op, b = input().split()

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


if __name__ ==  "__main__":
    main()

Solution (Python):
new = input()
new_str = new.split(" ")
first = int(new_str[0])
oper = new_str[1]
last = int(new_str[2])
if oper == "+":
  print(first + last)
elif oper == "-":
  print(first - last)

Solution (Python):
s = input()
s = s.split()
num1 = int(s[0])
op = s[1]
num2 = int(s[2])

if op == "+":
  print(num1+num2)
else:
  print(num1-num2)

Solution (Python):
a = input()
b = a.split()
first = int(b[0])
op = b[1]
second = int(b[2])

if(op == "-"):
  print(first-second)
elif(op == "+"):
  print(first + second)

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):
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,op,b=map(str,input().split())
a=int(a)
b=int(b)
if op == "-":
	print(a-b)
else:
	print(a+b)

Solution (Python):
a,x,b=map(str,input().split())
if x=="+":
    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):
a,op,b = map(str,input().split())
if op == '+':
    print(int(a)+int(b))
else:
    print(int(a)-int(b))

Solution (Python):
import sys

read = sys.stdin.read
readline = sys.stdin.buffer.readline
sys.setrecursionlimit(10 ** 8)
INF = float('inf')
MOD = 10 ** 9 + 7


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


if __name__ == '__main__':
    main()

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):
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=map(str,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 print(int(a) - int(c))

Solution (Python):

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


if __name__ == "__main__":
    main()

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

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

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, op, b = input().split()
a = int(a)
b = int(b)
print(a + b * (1 if op == "+" else -1))

Solution (Python):







a, op, b = map(str, input().split())

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

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

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

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

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

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

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

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

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

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

Solution (Python):

print(eval(input()))

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, b, c = list(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,o,p=input().split()
a=int(a)
p=int(p)
if o=="+":
    print(a+p)
else:
    print(a-p)

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())
A = int(A)
B = int(B)
if op == '+':
  print(A+B)
if op == '-':
  print(A-B)

Solution (Python):
li=input().split()
print(eval(li[0]+li[1]+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, 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=input().split()
if a[1]=="+":
  print(int(a[0])+int(a[2]))
else:
  print(int(a[0])-int(a[2]))

Solution (Python):

















import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
import numpy as np
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

print(eval(input().replace(",", " ")))

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

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