//qf
#include <bits/stdc++.h>
#define f(i,j,n) for(register int i=j;i<=n;i++)
using namespace std;
typedef long long ll;
inline ll read(){
ll x=0;
int f=1;
char ch=getchar();
while(!isdigit(ch)) {
if(ch=='-') f=-1;
ch=getchar();
}
while(isdigit(ch)) x=(x<<1)+(x<<3)+ch-48,ch=getchar();
return x*f;
}
int a=read(),b=read();
char ch=getchar();
inline void solve(){
if(ch=='+') cout<<a+b<<endl;
if(ch=='-') cout<<a-b<<endl;
if(ch=='*') cout<<a*b<<endl;
if(ch=='/') {
if(b) cout<<a/b<<endl;
else puts("Divided by zero!");
}
if(ch!='+' and ch!='-' and ch!='*' and ch!='/') puts("Invalid operator!");
}
signed main(){
solve();
return 0;
}