stablegradients/pie-gem5-pairs huggingface dataset:
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;

int main() {

  int a,b;

  char c;

  cin>>a>>c>>b;

  if (c=='+') cout<<a+b;

  else cout<<a-b;

  

}

// Faster C++ solution for the same problem (measured speedup: 5.229646638014157x):
#include <cstdio>



using namespace std;



int main()

{

  long long a, b;

  char op;



  scanf("%lld %c %lld", &a, &op, &b);

  if (op == '+') {

    printf("%lld\n", a+b);

  } else if (op == '-') {

    printf("%lld\n", a-b);

  }

  return 0;

}
// Slower C++ solution:
#include <bits/stdc++.h>



using namespace std;



int main() {

	int a,b;

	string c;

	cin >> a >> c >> b;

	if (c == "+") cout << a + b;

	else cout << a - b;

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.2799931997524325x):
#include <cstdio>



using namespace std;



int main()

{

  long long a, b;

  char op;



  scanf("%lld %c %lld", &a, &op, &b);

  if (op == '+') {

    printf("%lld\n", a+b);

  } else if (op == '-') {

    printf("%lld\n", a-b);

  }

  return 0;

}
// Slower C++ solution:
#include<iostream>

using namespace std;

int main()

{

    int a,b;

    char x,y,z;

    scanf("%d",&a);

    scanf("%c",&x);

    scanf("%c",&y);

    scanf("%c",&z);

    scanf("%d",&b);

    if(y=='+')

    {

        cout<<a+b<<endl;

    }else

    cout<<a-b<<endl;

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.1979556777292135x):
#include <cstdio>



using namespace std;



int main()

{

  long long a, b;

  char op;



  scanf("%lld %c %lld", &a, &op, &b);

  if (op == '+') {

    printf("%lld\n", a+b);

  } else if (op == '-') {

    printf("%lld\n", a-b);

  }

  return 0;

}
// Slower C++ solution:
#include <iostream>



using namespace std;



int main()

{

int A,B;

char x;

cin>>A>>x>>B;

if(x=='-'){cout<<A-B;}

if(x=='+'){cout<<A+B;}



return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.2318356651644375x):
#include <cstdio>



using namespace std;



int main()

{

  long long a, b;

  char op;



  scanf("%lld %c %lld", &a, &op, &b);

  if (op == '+') {

    printf("%lld\n", a+b);

  } else if (op == '-') {

    printf("%lld\n", a-b);

  }

  return 0;

}
// Slower C++ solution:
#include <iostream>



using namespace std;



int main()

{

   int a , b ;

   char op;

   cin>>a>>op>>b;

   if(op=='+'){

        cout<<a+b;}

   else if (op=='-'){cout<<a-b;}

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.231838680986344x):
#include <cstdio>



using namespace std;



int main()

{

  long long a, b;

  char op;



  scanf("%lld %c %lld", &a, &op, &b);

  if (op == '+') {

    printf("%lld\n", a+b);

  } else if (op == '-') {

    printf("%lld\n", a-b);

  }

  return 0;

}
// Slower C++ solution:
#include <iostream>

using namespace std;

int main()

{

    int A,B;

    A>=1 && A<=1000000000 ;

    B>=1 && B<=1000000000 ;

    char op;

    cin>>A>>op>>B;

    if((op) == '+') cout << A + B;

    if ((op) == '-') cout << A - B;

    return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.23183178767913x):
#include <cstdio>



using namespace std;



int main()

{

  long long a, b;

  char op;



  scanf("%lld %c %lld", &a, &op, &b);

  if (op == '+') {

    printf("%lld\n", a+b);

  } else if (op == '-') {

    printf("%lld\n", a-b);

  }

  return 0;

}
// Slower C++ solution:
#include<bits/stdc++.h>

#include<string>

using namespace std;



int main() {

int a,b;

char c;

cin>>a>>c>>b;

if(c=='+')

    cout<<a+b;

else{cout<<a-b;}

    return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.229646638014157x):
#include <cstdio>



using namespace std;



int main()

{

  long long a, b;

  char op;



  scanf("%lld %c %lld", &a, &op, &b);

  if (op == '+') {

    printf("%lld\n", a+b);

  } else if (op == '-') {

    printf("%lld\n", a-b);

  }

  return 0;

}
// Slower C++ solution:
#include <iostream>



using namespace std;



int main()

{

    int A,b;

    char x;

    cin>>A>>x>>b;

    if (x=='+')

        cout<<A+b;

    else

        cout<<A-b;

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.229646638014157x):
#include <cstdio>



using namespace std;



int main()

{

  long long a, b;

  char op;



  scanf("%lld %c %lld", &a, &op, &b);

  if (op == '+') {

    printf("%lld\n", a+b);

  } else if (op == '-') {

    printf("%lld\n", a-b);

  }

  return 0;

}
// Slower C++ solution:
#include <iostream>



using namespace std;



int main()

{

    int a,b; char op = ('+' || '-');

    cin >>a>>op>>b;

    switch(op)

    {

    case '+':

        cout <<a+b;

        break;

    case '-':

        cout <<a-b;

        break;

    }

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.232138496767018x):
#include <cstdio>



using namespace std;



int main()

{

  long long a, b;

  char op;



  scanf("%lld %c %lld", &a, &op, &b);

  if (op == '+') {

    printf("%lld\n", a+b);

  } else if (op == '-') {

    printf("%lld\n", a-b);

  }

  return 0;

}
// Slower C++ solution:
#include<iostream>

using namespace std;

int main(){

  int a,b; char op;

  cin >> a >> op >>b;

  if(op =='+')

    cout << a + b << endl;

  else

    cout << a - b << endl;

}

// Faster C++ solution for the same problem (measured speedup: 5.238992425964336x):
#include <cstdio>



using namespace std;



int main()

{

  long long a, b;

  char op;



  scanf("%lld %c %lld", &a, &op, &b);

  if (op == '+') {

    printf("%lld\n", a+b);

  } else if (op == '-') {

    printf("%lld\n", a-b);

  }

  return 0;

}
// Slower C++ solution:
#include <iostream>

#include <cstdio>

using namespace std;

const int N = 100005;

int a,b;

char op;

int main(){

	cin>>a>>op>>b;

	if(op == '+')

		cout<<a+b<<endl;

	else

		cout<<a-b<<endl;

}

// Faster C++ solution for the same problem (measured speedup: 5.238786689466089x):
#include <cstdio>



using namespace std;



int main()

{

  long long a, b;

  char op;



  scanf("%lld %c %lld", &a, &op, &b);

  if (op == '+') {

    printf("%lld\n", a+b);

  } else if (op == '-') {

    printf("%lld\n", a-b);

  }

  return 0;

}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;

#define ll long long

#define x first

#define y second

#define mp make_pair

#define pb push_back

#define kk 1000000007

int n,m,k,a,b,c,tmp,cc[300005];

vector<int > ee;

map<int ,int > mm;

char g;

int main(){

	scanf("%d%c%c%d",&a,&g,&g,&b);

	if (g == '+') printf("%d\n",a+b);

	else printf("%d\n",a-b);

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.216700777287885x):
#include <cstdio>



using namespace std;



int main()

{

  long long a, b;

  char op;



  scanf("%lld %c %lld", &a, &op, &b);

  if (op == '+') {

    printf("%lld\n", a+b);

  } else if (op == '-') {

    printf("%lld\n", a-b);

  }

  return 0;

}
// Slower C++ solution:
#include <iostream>

using namespace std;

long long a,b;

string x;

int main()

{

    cin>>a>>x>>b;

    if (x=="+")

    {

        cout<<a+b<<endl;

    }

    else if (x=="-")

    {

        cout<<a-b<<endl;

    }

}

// Faster C++ solution for the same problem (measured speedup: 5.243422582178598x):
#include <cstdio>



using namespace std;



int main()

{

  long long a, b;

  char op;



  scanf("%lld %c %lld", &a, &op, &b);

  if (op == '+') {

    printf("%lld\n", a+b);

  } else if (op == '-') {

    printf("%lld\n", a-b);

  }

  return 0;

}
// Slower C++ solution:


#include<bits/stdc++.h>

#define lln long long int

#define llu unsigned lln

#define sc(n) scanf("%d",&n);

#define scl(n) scanf("%lld",&n);

#define scd(n) scanf("%lf",&n);

#define pf(res) printf("%d\n",res);

#define pfl(res) printf("%lld\n",res);

#define pfd(res) printf("%lf\n",res);

#define maxii 200005

using namespace std;

typedef pair<int,int> pii;

typedef pair<lln,lln> pll;

 vector<int> vi[maxii];

 vector<int>::iterator child;

typedef vector<lln> vl;

typedef vector<pii> vii;

typedef vector<pll> vll;





int arr[maxii];

int arr2[maxii];





int main()

{

    char a;

    int b,c;

    cin>>b>>a>>c;

    if(a=='+')cout<<b+c;

    else cout<<b-c;

}










// Faster C++ solution for the same problem (measured speedup: 6.4784340747095746x):
# include <iostream>

using namespace std;



int main()

{

    char op;

    int num1, num2;



    cin >> num1 >> op >> num2;



    if (op == '+')

        cout << num1+num2;



    if (op == '-')

        cout << num1-num2;

}
// Slower C++ solution:


#include<bits/stdc++.h>

#define lln long long int

#define llu unsigned lln

#define sc(n) scanf("%d",&n);

#define scl(n) scanf("%lld",&n);

#define scd(n) scanf("%lf",&n);

#define pf(res) printf("%d\n",res);

#define pfl(res) printf("%lld\n",res);

#define pfd(res) printf("%lf\n",res);

#define maxii 200005

using namespace std;

typedef pair<int,int> pii;

typedef pair<lln,lln> pll;

 vector<int> vi[maxii];

 vector<int>::iterator child;

typedef vector<lln> vl;

typedef vector<pii> vii;

typedef vector<pll> vll;





int arr[maxii];

int arr2[maxii];





int main()

{

    char a;

    int b,c;

    cin>>b>>a>>c;

    if(a=='+')cout<<b+c;

    else cout<<b-c;

}










// Faster C++ solution for the same problem (measured speedup: 6.549600440586929x):
#include<iostream>

#include<cstring>

#include<cstdio>

using namespace std;

int main()

{

 int a,b;

 char ch;

 scanf("%d %c %d",&a,&ch,&b);

 if(ch=='+') printf("%d\n",a+b);

 else printf("%d\n",a-b);



}
// Slower C++ solution:


#include<bits/stdc++.h>

#define lln long long int

#define llu unsigned lln

#define sc(n) scanf("%d",&n);

#define scl(n) scanf("%lld",&n);

#define scd(n) scanf("%lf",&n);

#define pf(res) printf("%d\n",res);

#define pfl(res) printf("%lld\n",res);

#define pfd(res) printf("%lf\n",res);

#define maxii 200005

using namespace std;

typedef pair<int,int> pii;

typedef pair<lln,lln> pll;

 vector<int> vi[maxii];

 vector<int>::iterator child;

typedef vector<lln> vl;

typedef vector<pii> vii;

typedef vector<pll> vll;





int arr[maxii];

int arr2[maxii];





int main()

{

    char a;

    int b,c;

    cin>>b>>a>>c;

    if(a=='+')cout<<b+c;

    else cout<<b-c;

}










// Faster C++ solution for the same problem (measured speedup: 6.469579371497245x):
#include<iostream>



using namespace std;



int main()

{

    int a, b;

    char ch;

    cin>>a>>ch>>b;

    if(ch == 43) cout<<a + b<<endl;

    else cout<<a - b<<endl;

    return 0;

}
// Slower C++ solution:


#include<bits/stdc++.h>

#define lln long long int

#define llu unsigned lln

#define sc(n) scanf("%d",&n);

#define scl(n) scanf("%lld",&n);

#define scd(n) scanf("%lf",&n);

#define pf(res) printf("%d\n",res);

#define pfl(res) printf("%lld\n",res);

#define pfd(res) printf("%lf\n",res);

#define maxii 200005

using namespace std;

typedef pair<int,int> pii;

typedef pair<lln,lln> pll;

 vector<int> vi[maxii];

 vector<int>::iterator child;

typedef vector<lln> vl;

typedef vector<pii> vii;

typedef vector<pll> vll;





int arr[maxii];

int arr2[maxii];





int main()

{

    char a;

    int b,c;

    cin>>b>>a>>c;

    if(a=='+')cout<<b+c;

    else cout<<b-c;

}










// Faster C++ solution for the same problem (measured speedup: 6.4811410163115175x):
#include<iostream>

using namespace std;

int main()

{

    int a,b;

    char c;

    cin>>a>>c>>b;

    if(c=='+')

        cout<<a+b;

    else

        cout<<a-b;

    return 0;

}
// Slower C++ solution:


#include<bits/stdc++.h>

#define lln long long int

#define llu unsigned lln

#define sc(n) scanf("%d",&n);

#define scl(n) scanf("%lld",&n);

#define scd(n) scanf("%lf",&n);

#define pf(res) printf("%d\n",res);

#define pfl(res) printf("%lld\n",res);

#define pfd(res) printf("%lf\n",res);

#define maxii 200005

using namespace std;

typedef pair<int,int> pii;

typedef pair<lln,lln> pll;

 vector<int> vi[maxii];

 vector<int>::iterator child;

typedef vector<lln> vl;

typedef vector<pii> vii;

typedef vector<pll> vll;





int arr[maxii];

int arr2[maxii];





int main()

{

    char a;

    int b,c;

    cin>>b>>a>>c;

    if(a=='+')cout<<b+c;

    else cout<<b-c;

}










// Faster C++ solution for the same problem (measured speedup: 6.461300193767433x):
#include <iostream>

#include <string>

using namespace std;



int a, b;

string op, tambah="+";



int main (){

	cin>>a>>op>>b;

	if (op [0]==tambah [0]){

		cout<<a+b<<endl;

	}else {

		cout<<a-b<<endl;

	}

}
// Slower C++ solution:


#include<bits/stdc++.h>

#define lln long long int

#define llu unsigned lln

#define sc(n) scanf("%d",&n);

#define scl(n) scanf("%lld",&n);

#define scd(n) scanf("%lf",&n);

#define pf(res) printf("%d\n",res);

#define pfl(res) printf("%lld\n",res);

#define pfd(res) printf("%lf\n",res);

#define maxii 200005

using namespace std;

typedef pair<int,int> pii;

typedef pair<lln,lln> pll;

 vector<int> vi[maxii];

 vector<int>::iterator child;

typedef vector<lln> vl;

typedef vector<pii> vii;

typedef vector<pll> vll;





int arr[maxii];

int arr2[maxii];





int main()

{

    char a;

    int b,c;

    cin>>b>>a>>c;

    if(a=='+')cout<<b+c;

    else cout<<b-c;

}










// Faster C++ solution for the same problem (measured speedup: 6.469725558844256x):
#include <bits/stdc++.h>

using namespace std;

int x,y;

char c;

int main() {

cin>>x>>c>>y;

if(c=='+') {

	cout<<x+y<<endl;

} else if(c=='-') {

	cout<<x-y<<endl;

}

}
// Slower C++ solution:
#include <iostream>

#include <stdio.h> 



using namespace std;

int main(){

	int A, B;

	string op;

	cin>>A>>op>>B;

	if(op=="+"){

		cout<<A+B;

	}else if(op=="-"){

		cout<<A-B;

	}

	return 0;

	

}

// Faster C++ solution for the same problem (measured speedup: 5.280456877948113x):
#include<cstdio>

using namespace std;

int ans,a,b;

char op,stp1,stp2;

int main(){

	scanf("%d",&a);

	scanf("%c",&stp1);

	scanf("%c",&op);

	scanf("%c",&stp2);

	scanf("%d",&b);

	if (op=='+'){

		ans=a+b;

	}else if (op=='-'){

		ans=a-b;

	}

	printf("%d",ans);

return 0;}
// Slower C++ solution:
#include <iostream>

#include "string.h"

using namespace std;

int main(){

long n,m;

string x;

cin>>n>>x>>m;

if(x=="+"){

    cout<<n+m<<endl;

}

if(x=="-"){

    cout<<n-m<<endl;

}



}


// Faster C++ solution for the same problem (measured speedup: 5.285401495041981x):
#include<cstdio>

using namespace std;

int ans,a,b;

char op,stp1,stp2;

int main(){

	scanf("%d",&a);

	scanf("%c",&stp1);

	scanf("%c",&op);

	scanf("%c",&stp2);

	scanf("%d",&b);

	if (op=='+'){

		ans=a+b;

	}else if (op=='-'){

		ans=a-b;

	}

	printf("%d",ans);

return 0;}
// Slower C++ solution:
#include<iostream>

using namespace std;

int main(){

int a,b;

char op;

cin>>a;

cin>>op;

cin>>b;

if(op=='+')

  cout<<a + b;

else 

  cout<<a - b;

return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.233438866035169x):
#include<cstdio>

using namespace std;

int ans,a,b;

char op,stp1,stp2;

int main(){

	scanf("%d",&a);

	scanf("%c",&stp1);

	scanf("%c",&op);

	scanf("%c",&stp2);

	scanf("%d",&b);

	if (op=='+'){

		ans=a+b;

	}else if (op=='-'){

		ans=a-b;

	}

	printf("%d",ans);

return 0;}
// Slower C++ solution:
#include <iostream>





using namespace std;



int main()

{

int a , b;

char op;

scanf("%d %c %d",&a,&op,&b);



if(op=='+')

printf("%d",a+b);

if(op=='-')

printf("%d",a-b);

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.175309697363687x):
#include<cstdio>

using namespace std;

int ans,a,b;

char op,stp1,stp2;

int main(){

	scanf("%d",&a);

	scanf("%c",&stp1);

	scanf("%c",&op);

	scanf("%c",&stp2);

	scanf("%d",&b);

	if (op=='+'){

		ans=a+b;

	}else if (op=='-'){

		ans=a-b;

	}

	printf("%d",ans);

return 0;}
// Slower C++ solution:
#include <iostream>

using namespace std;

int main(){

int x,y,result;char m;

cin >> x>> m >> y;

if (m=='+'){

  result=x+y;

}

else if (m=='-'){

  result = x-y;

}cout << result;

return 0;}

// Faster C++ solution for the same problem (measured speedup: 5.230978846382133x):
#include<cstdio>

using namespace std;

int ans,a,b;

char op,stp1,stp2;

int main(){

	scanf("%d",&a);

	scanf("%c",&stp1);

	scanf("%c",&op);

	scanf("%c",&stp2);

	scanf("%d",&b);

	if (op=='+'){

		ans=a+b;

	}else if (op=='-'){

		ans=a-b;

	}

	printf("%d",ans);

return 0;}
// Slower C++ solution:
#include <iostream>

using namespace std ;

int main() {

    int a, b;

    char op;

    cin >> a >> op >> b;

    if (op == '+') cout << a+b;

    else cout << a-b;

    return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.230927837776373x):
#include<cstdio>

using namespace std;

int ans,a,b;

char op,stp1,stp2;

int main(){

	scanf("%d",&a);

	scanf("%c",&stp1);

	scanf("%c",&op);

	scanf("%c",&stp2);

	scanf("%d",&b);

	if (op=='+'){

		ans=a+b;

	}else if (op=='-'){

		ans=a-b;

	}

	printf("%d",ans);

return 0;}
// Slower C++ solution:
#include <iostream>

using namespace std;



//Compiler version g++ 6.3.0



int main()

{

    int a, b;

    char s;

    cin >>a>>s>>b;

    if (s=='+' ) cout<<a+b;

    if(s=='-' )cout<<a-b;

}

// Faster C++ solution for the same problem (measured speedup: 5.233113522776413x):
#include<cstdio>

using namespace std;

int ans,a,b;

char op,stp1,stp2;

int main(){

	scanf("%d",&a);

	scanf("%c",&stp1);

	scanf("%c",&op);

	scanf("%c",&stp2);

	scanf("%d",&b);

	if (op=='+'){

		ans=a+b;

	}else if (op=='-'){

		ans=a-b;

	}

	printf("%d",ans);

return 0;}
// Slower C++ solution:
#include <iostream>

#include <string>

using namespace std;

int main()

{

int a,b;

char op;

cin>>a>>op>>b;

if(op=='+'){

cout<<a+b;

}

if(op=='-'){

cout<<a-b;

}



 return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.233113522776413x):
#include<cstdio>

using namespace std;

int ans,a,b;

char op,stp1,stp2;

int main(){

	scanf("%d",&a);

	scanf("%c",&stp1);

	scanf("%c",&op);

	scanf("%c",&stp2);

	scanf("%d",&b);

	if (op=='+'){

		ans=a+b;

	}else if (op=='-'){

		ans=a-b;

	}

	printf("%d",ans);

return 0;}
// Slower C++ solution:
#include <iostream>

using namespace std;

int main() {

    long long int a,b;

    char op;

    cin>>a>>op>>b;

    if(op=='+'){

        cout<<a+b<<endl;

    }

    else if(op=='-'){

        cout<<a-b<<endl;

    }

    system("pause");

}


// Faster C++ solution for the same problem (measured speedup: 5.253281544060806x):
#include<cstdio>

using namespace std;

int ans,a,b;

char op,stp1,stp2;

int main(){

	scanf("%d",&a);

	scanf("%c",&stp1);

	scanf("%c",&op);

	scanf("%c",&stp2);

	scanf("%d",&b);

	if (op=='+'){

		ans=a+b;

	}else if (op=='-'){

		ans=a-b;

	}

	printf("%d",ans);

return 0;}
// Slower C++ solution:
#include <iostream>

#include <bits/stdc++.h>



using namespace std;



int main()

{

    string op;

    int A,B;

    cin >>A;

    cin >>op;

    cin >>B;

    if(op == "+")

    {

        cout <<A+B<<endl;

    }

    else if(op == "-")

    {

        cout << A-B <<endl;

    }

    return 0;



}


// Faster C++ solution for the same problem (measured speedup: 5.291452471700925x):
#include<cstdio>

using namespace std;

int ans,a,b;

char op,stp1,stp2;

int main(){

	scanf("%d",&a);

	scanf("%c",&stp1);

	scanf("%c",&op);

	scanf("%c",&stp2);

	scanf("%d",&b);

	if (op=='+'){

		ans=a+b;

	}else if (op=='-'){

		ans=a-b;

	}

	printf("%d",ans);

return 0;}
// Slower C++ solution:
#include <iostream>

using namespace std; 

int main()

{

	int A,B;

	string op ; 

	cin>>A>>op>>B;

	if(op=="+")

	{

	cout<<A+B;

	}

	else 

	cout<<A-B;

	

}

// Faster C++ solution for the same problem (measured speedup: 5.281286733809371x):
#include<cstdio>

using namespace std;

int ans,a,b;

char op,stp1,stp2;

int main(){

	scanf("%d",&a);

	scanf("%c",&stp1);

	scanf("%c",&op);

	scanf("%c",&stp2);

	scanf("%d",&b);

	if (op=='+'){

		ans=a+b;

	}else if (op=='-'){

		ans=a-b;

	}

	printf("%d",ans);

return 0;}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;

int main()

{

    int a,b;

    char s;

    cin>>a>>s>>b;

    if(s=='+') cout<<a+b<<endl;

    else cout<<a-b<<endl;

    return 0;

}




// Faster C++ solution for the same problem (measured speedup: 5.24086592588362x):
#include<cstdio>

using namespace std;

int ans,a,b;

char op,stp1,stp2;

int main(){

	scanf("%d",&a);

	scanf("%c",&stp1);

	scanf("%c",&op);

	scanf("%c",&stp2);

	scanf("%d",&b);

	if (op=='+'){

		ans=a+b;

	}else if (op=='-'){

		ans=a-b;

	}

	printf("%d",ans);

return 0;}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;



int main()

{

    int a,b,d=0;

    string c;

    cin>>a>>c>>b;

    if(c[0]=='+')

    {

        d=a+b;

    }

    else

    {

        d=a-b;

    }

    cout<<d<<endl;

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.285112594709952x):
#include<cstdio>

using namespace std;

int ans,a,b;

char op,stp1,stp2;

int main(){

	scanf("%d",&a);

	scanf("%c",&stp1);

	scanf("%c",&op);

	scanf("%c",&stp2);

	scanf("%d",&b);

	if (op=='+'){

		ans=a+b;

	}else if (op=='-'){

		ans=a-b;

	}

	printf("%d",ans);

return 0;}
// Slower C++ solution:
#include<cstdio>

#include<iostream>

#include<algorithm>

#include<cmath>

#include<cstring>

#include<string>

#include<vector>

using namespace std;



#define ll long long



#define debug_message 0

#define debug if (debug_message)



#define sz(x) (int)x.size()



ll i,t,j;

ll n,m,nt,a,b;

string s,s1,s2;

char c;



int main(){

	scanf("%lld %c %lld",&a,&c,&b);

	

	if (c=='+') printf("%lld\n",a+b);

	else if (c=='-') printf("%lld\n",a-b);

	

	return 0;

}

/*



*/

// Faster C++ solution for the same problem (measured speedup: 5.17930855084077x):
#include<cstdio>

using namespace std;

int ans,a,b;

char op,stp1,stp2;

int main(){

	scanf("%d",&a);

	scanf("%c",&stp1);

	scanf("%c",&op);

	scanf("%c",&stp2);

	scanf("%d",&b);

	if (op=='+'){

		ans=a+b;

	}else if (op=='-'){

		ans=a-b;

	}

	printf("%d",ans);

return 0;}
// Slower C++ solution:
#include <iostream>

#include <cstring>

#include <string>

#include <sstream>

#include <string>

#include <cstdio>

#include <algorithm>

#include <deque>

#include <set>

#include <vector>

#include <cmath>

#include <stack>

#include <set>

#include <map>

#include <queue>

#define maxn 10005

using namespace std;

typedef long long ll;

typedef unsigned long long ull;

int m,n;

int a[maxn],b[maxn];



int main()

{

    while(scanf("%d",&n)!=EOF)

    {

        for(int i=0;i<n;i++)

            scanf("%d",&a[i]);

        for(int i=0;i<n;i++)

            scanf("%d",&b[i]);

        ll suma=0,sumb=0;

        for(int i=0;i<n;i++)

        {

            if(a[i]>b[i])

                sumb+=a[i]-b[i];

            if(a[i]<b[i])

                suma+=(b[i]-a[i])/2;

        }

        if(suma<sumb)

            printf("No\n");

        else

            printf("Yes\n");

    }

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.198903122377337x):
#include<cstdio>

#include<algorithm>

using namespace std;

typedef long long ll;

int n;

ll a[10100], b[10100];

ll atot = 0, btot = 0;

int main()

{

	scanf("%d", &n);

	for (int i = 1; i <= n; i++)

	{

		scanf("%lld", &a[i]);

		atot += a[i];

	}

	for (int i = 1; i <= n; i++)

	{

		scanf("%lld", &b[i]);

		btot += b[i];

	}

	if (atot > btot) { printf("No\n"); return 0; }

	int p = 1;

	for (int i = 1; i <= n; i++)

	{

		if (a[i] > b[i])

		{

			while (p <= n && (b[p] - a[p]) / 2 <= 0) p++;

			if (p > n)

			{

				printf("No\n"); return 0;

			}

			ll t = min(a[i] - b[i], (b[p] - a[p]) / 2);

			b[i] += t; a[p] += (2 * t);

			i--;

			continue;

		}

	}

	bool flag = false;

	for (int i = 1; i <= n; i++)

	{

		if (a[i] > b[i]) { flag = true; break; }

	}

	if (flag) printf("No\n");

	else printf("Yes\n");

	return 0;

}