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;

    switch (c){

        case '+':

            cout << a+b << endl;

            break;

        case '-':

            cout << a-b << endl;

            break;

    }

    return 0;

}


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

using namespace std;



int main() {

  int a,b;

  char f;

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

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

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

  return 0;

}
// 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.229029512322896x):
#include <cstdio>

using namespace std;



int main() {

  int a,b;

  char f;

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

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

  else printf("%d\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.279370132903218x):
#include <cstdio>

using namespace std;



int main() {

  int a,b;

  char f;

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

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

  else printf("%d\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.197342291737234x):
#include <cstdio>

using namespace std;



int main() {

  int a,b;

  char f;

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

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

  else printf("%d\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.23121828115651x):
#include <cstdio>

using namespace std;



int main() {

  int a,b;

  char f;

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

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

  else printf("%d\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.231221296622533x):
#include <cstdio>

using namespace std;



int main() {

  int a,b;

  char f;

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

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

  else printf("%d\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.231214404128765x):
#include <cstdio>

using namespace std;



int main() {

  int a,b;

  char f;

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

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

  else printf("%d\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.229029512322896x):
#include <cstdio>

using namespace std;



int main() {

  int a,b;

  char f;

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

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

  else printf("%d\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.229029512322896x):
#include <cstdio>

using namespace std;



int main() {

  int a,b;

  char f;

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

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

  else printf("%d\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.231521077023373x):
#include <cstdio>

using namespace std;



int main() {

  int a,b;

  char f;

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

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

  else printf("%d\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.2383741974211535x):
#include <cstdio>

using namespace std;



int main() {

  int a,b;

  char f;

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

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

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

  return 0;

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





using namespace std;



int main()

{

    long long a  , b;

    char ch;

    cin >> a >> ch >> b;

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

    else cout << (a - b) << endl;



    return 0;

}


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

using namespace std;



char c;

int a , b;

 

int main () {

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

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

	else if (c == '-') {

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

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

	}

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



using namespace std;



int main()

{

    long long int a, b;

    char ch;



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



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

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

    return 0;

}


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

using namespace std;



char c;

int a , b;

 

int main () {

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

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

	else if (c == '-') {

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

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

	}

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

using namespace std;

int main(){

long long a,b,x;

char ch;

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

if(ch=='+'){

    x=a+b;

printf("%lld\n",x);



}

else if(ch=='-'){

       x=a-b;

printf("%lld\n",x);

}





return 0;



}


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

using namespace std;



char c;

int a , b;

 

int main () {

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

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

	else if (c == '-') {

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

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

	}

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

using namespace std;



int main()

{

    int x, y;

    string s;

    cin >> x >> s >> y;

    if(s == "+") cout << x + y << '\n';

    else cout << x - y << '\n';

    return 0;

}


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

using namespace std;



char c;

int a , b;

 

int main () {

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

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

	else if (c == '-') {

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

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

	}

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

using namespace std;



int main(){

    int a, b;

    char op;

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

    int res;

    if(op == '+') res = a + b;

    if(op == '-') res = a - b;

    printf("%d\n", res);

    return 0;

}


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

using namespace std;



char c;

int a , b;

 

int main () {

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

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

	else if (c == '-') {

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

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

	}

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

#include <cstdio>

#include <cmath>

#include <cstring>

#include <algorithm>

#include <vector>

#include <map>

#include <cstdlib>

#include <set>

#include <queue>

using namespace std;



#define X first

#define Y second

#define N 62

typedef long long ll;

typedef pair<int,int> pii;

const int Mod=1000000007;



const double INF=1e18;





int main()

{

	//freopen("in.in","r",stdin);

	//freopen("out.out","w",stdout);

	

	int a,b; char op;

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

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

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

	

	return 0;



}


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

using namespace std;



char c;

int a , b;

 

int main () {

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

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

	else if (c == '-') {

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

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

	}

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



using namespace std;



int main()

{

	int a,b;

	char c;

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

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

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

}

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

using namespace std;



char c;

int a , b;

 

int main () {

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

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

	else if (c == '-') {

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

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

	}

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



using namespace std;



typedef long long LL;



int main() {

    int a, b;

    char c;

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

    printf("%d\n", c == '+' ? a + b : a - b);

    return 0;

}


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

using namespace std;



char c;

int a , b;

 

int main () {

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

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

	else if (c == '-') {

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

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

	}

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

using namespace std;

int main()

{

    int a,b;

    char c;

    cin >> a >> c >> b;

    switch (c){

        case '+':

            cout << a+b << endl;

            break;

        case '-':

            cout << a-b << endl;

            break;

    }

    return 0;

}


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

using namespace std;



char c;

int a , b;

 

int main () {

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

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

	else if (c == '-') {

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

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

	}

}
// 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.231423283081434x):
#include <cstdio>

using namespace std;



char c;

int a , b;

 

int main () {

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

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

	else if (c == '-') {

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

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

	}

}
// 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.281786948837775x):
#include <cstdio>

using namespace std;



char c;

int a , b;

 

int main () {

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

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

	else if (c == '-') {

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

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

	}

}
// 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.199721556564628x):
#include <cstdio>

using namespace std;



char c;

int a , b;

 

int main () {

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

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

	else if (c == '-') {

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

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

	}

}
// 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.233613053900372x):
#include <cstdio>

using namespace std;



char c;

int a , b;

 

int main () {

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

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

	else if (c == '-') {

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

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

	}

}
// 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.233616070746831x):
#include <cstdio>

using namespace std;



char c;

int a , b;

 

int main () {

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

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

	else if (c == '-') {

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

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

	}

}
// 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.233609175097783x):
#include <cstdio>

using namespace std;



char c;

int a , b;

 

int main () {

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

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

	else if (c == '-') {

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

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

	}

}
// 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.231423283081434x):
#include <cstdio>

using namespace std;



char c;

int a , b;

 

int main () {

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

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

	else if (c == '-') {

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

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

	}

}
// 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.231423283081434x):
#include <cstdio>

using namespace std;



char c;

int a , b;

 

int main () {

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

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

	else if (c == '-') {

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

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

	}

}
// 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.233915988382613x):
#include <cstdio>

using namespace std;



char c;

int a , b;

 

int main () {

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

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

	else if (c == '-') {

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

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

	}

}
// 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.240772246035436x):
#include <cstdio>

using namespace std;



char c;

int a , b;

 

int main () {

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

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

	else if (c == '-') {

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

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

	}

}
// 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.240566439643224x):
#include <cstdio>

using namespace std;



char c;

int a , b;

 

int main () {

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

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

	else if (c == '-') {

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

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

	}

}
// 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.218473024314303x):
#include <cstdio>

using namespace std;



char c;

int a , b;

 

int main () {

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

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

	else if (c == '-') {

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

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

	}

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





using namespace std;



int main()

{

    long long a  , b;

    char ch;

    cin >> a >> ch >> b;

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

    else cout << (a - b) << endl;



    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.235240240875706x):
#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()

{

    long long int a, b;

    char ch;



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



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

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

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.173397093169897x):
#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(){

long long a,b,x;

char ch;

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

if(ch=='+'){

    x=a+b;

printf("%lld\n",x);



}

else if(ch=='-'){

       x=a-b;

printf("%lld\n",x);

}





return 0;



}


// Faster C++ solution for the same problem (measured speedup: 5.173408251710951x):
#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 x, y;

    string s;

    cin >> x >> s >> y;

    if(s == "+") cout << x + y << '\n';

    else cout << x - y << '\n';

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.28340960897442x):
#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;

    char op;

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

    int res;

    if(op == '+') res = a + b;

    if(op == '-') res = a - b;

    printf("%d\n", res);

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.1750278198800075x):
#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>

#include <cmath>

#include <cstring>

#include <algorithm>

#include <vector>

#include <map>

#include <cstdlib>

#include <set>

#include <queue>

using namespace std;



#define X first

#define Y second

#define N 62

typedef long long ll;

typedef pair<int,int> pii;

const int Mod=1000000007;



const double INF=1e18;





int main()

{

	//freopen("in.in","r",stdin);

	//freopen("out.out","w",stdout);

	

	int a,b; char op;

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

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

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

	

	return 0;



}


// Faster C++ solution for the same problem (measured speedup: 5.174983975573911x):
#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;

	char c;

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

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

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

}

// Faster C++ solution for the same problem (measured speedup: 5.174983975573911x):
#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;



typedef long long LL;



int main() {

    int a, b;

    char c;

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

    printf("%d\n", c == '+' ? a + b : a - b);

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.173751725103984x):
#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;

    char c;

    cin >> a >> c >> b;

    switch (c){

        case '+':

            cout << a+b << endl;

            break;

        case '-':

            cout << a-b << endl;

            break;

    }

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.239902514849368x):
#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;

}