stablegradients/pie-gem5-pairs huggingface dataset:
// 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.234408466714866x):
#include<stdio.h>

main()

{

    int a,b,ans;

    char c;

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

    if(c=='+')

        ans=a+b;

    else

        ans=a-b;

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

}
// 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<stdio.h>

#include<string.h>

int main()

{

    long long x,y;

    char c;

    scanf("%lld %c %lld",&x,&c,&y);

    if(c=='+')

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

    else if(c=='-')

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

    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<stdio.h>

#include<string.h>

int main()

{

    long long x,y;

    char c;

    scanf("%lld %c %lld",&x,&c,&y);

    if(c=='+')

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

    else if(c=='-')

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

    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.235404296592286x):
#include<stdio.h>

#include<string.h>

int main()

{

  int a,b,c;

  char cc;

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

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

  else if(cc=='-') printf("%d\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.173559210919651x):
#include<stdio.h>

#include<string.h>

int main()

{

  int a,b,c;

  char cc;

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

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

  else if(cc=='-') printf("%d\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.173570369810378x):
#include<stdio.h>

#include<string.h>

int main()

{

  int a,b,c;

  char cc;

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

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

  else if(cc=='-') 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.2270596124231945x):
#include<stdio.h>

int a,c;

char b[10];

int main(){

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

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

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

}
// 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.165313101316746x):
#include<stdio.h>

int a,c;

char b[10];

int main(){

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

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

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

}
// 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.165324242421375x):
#include<stdio.h>

int a,c;

char b[10];

int main(){

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

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

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

}
// 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.275153710680397x):
#include<stdio.h>

int a,c;

char b[10];

int main(){

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

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

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

}
// 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.166941279840201x):
#include<stdio.h>

int a,c;

char b[10];

int main(){

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

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

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

}
// 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.1668975040455685x):
#include<stdio.h>

int a,c;

char b[10];

int main(){

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

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

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

}
// 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.1668975040455685x):
#include<stdio.h>

int a,c;

char b[10];

int main(){

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

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

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

}
// 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.165667179100125x):
#include<stdio.h>

int a,c;

char b[10];

int main(){

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

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

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

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

int a,b,c,d,i,j,k;

char t;

int main(){

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

	if (t=='-'){

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

	}	

	if (t=='+'){

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

	}

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

int a,b,c,d,i,j,k;

char t;

int main(){

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

	if (t=='-'){

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

	}	

	if (t=='+'){

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

	}

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

int a,b,c,d,i,j,k;

char t;

int main(){

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

	if (t=='-'){

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

	}	

	if (t=='+'){

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

	}

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

int a,b,c,d,i,j,k;

char t;

int main(){

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

	if (t=='-'){

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

	}	

	if (t=='+'){

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

	}

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

int a,b,c,d,i,j,k;

char t;

int main(){

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

	if (t=='-'){

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

	}	

	if (t=='+'){

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

	}

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

int a,b,c,d,i,j,k;

char t;

int main(){

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

	if (t=='-'){

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

	}	

	if (t=='+'){

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

	}

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

int a,b,c,d,i,j,k;

char t;

int main(){

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

	if (t=='-'){

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

	}	

	if (t=='+'){

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

	}

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

int a,b,c,d,i,j,k;

char t;

int main(){

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

	if (t=='-'){

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

	}	

	if (t=='+'){

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

	}

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

int a,b,c,d,i,j,k;

char t;

int main(){

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

	if (t=='-'){

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

	}	

	if (t=='+'){

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

	}

}
// 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.234642524465934x):
#include <stdio.h>

#include <string.h>



int main(){

	char op;

	int a,b;



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



	if (op == '-') {

		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 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.172806437498986x):
#include <stdio.h>

#include <string.h>



int main(){

	char op;

	int a,b;



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



	if (op == '-') {

		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,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.17281759476605x):
#include <stdio.h>

#include <string.h>



int main(){

	char op;

	int a,b;



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



	if (op == '-') {

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

	}else{

		printf("%d\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.282806392984793x):
#include <stdio.h>

#include <string.h>



int main(){

	char op;

	int a,b;



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



	if (op == '-') {

		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 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.174436978026215x):
#include <stdio.h>

#include <string.h>



int main(){

	char op;

	int a,b;



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



	if (op == '-') {

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

	}else{

		printf("%d\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.174393138725898x):
#include <stdio.h>

#include <string.h>



int main(){

	char op;

	int a,b;



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



	if (op == '-') {

		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;

	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.174393138725898x):
#include <stdio.h>

#include <string.h>



int main(){

	char op;

	int a,b;



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



	if (op == '-') {

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

	}else{

		printf("%d\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.173161028944134x):
#include <stdio.h>

#include <string.h>



int main(){

	char op;

	int a,b;



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



	if (op == '-') {

		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;

    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.239304266139733x):
#include <stdio.h>

#include <string.h>



int main(){

	char op;

	int a,b;



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



	if (op == '-') {

		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.229049560235673x):
#include <stdio.h>

#include <string.h>



int main(){

	char op;

	int a,b;



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



	if (op == '-') {

		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.27939037382014x):
#include <stdio.h>

#include <string.h>



int main(){

	char op;

	int a,b;



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



	if (op == '-') {

		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.197362218162336x):
#include <stdio.h>

#include <string.h>



int main(){

	char op;

	int a,b;



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



	if (op == '-') {

		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.234622455110014x):
#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 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.17278660521951x):
#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,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.172797762443798x):
#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 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.282786138971026x):
#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 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.174417139495329x):
#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>

#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.174373300363089x):
#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;

	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.174373300363089x):
#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;



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.173141195305172x):
#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;

}