#include<iostream>
#include<string.h>
#include<algorithm>
#include<string>
using namespace std ;
/*基本思路比较简单,就是代码比较长,我是比价菜鸡的那种;
1.判断A , B的正负;
2.判断去掉符号的数字的大小比较;
3.A > 0 , B > 0 , 两个数直接相加;
A < 0 , B < 0 , 去掉符号相加,最后输出多一个负号就行;
A < 0 , B > 0 最麻烦,
判断去掉符号的大小,若有|A| < |B| , 输出 B-A ;
若有 |A| > |B| , 输出 -(|A| - |B|) ;
*/
int depend(string a, string b){//判断大小,长度长的一定大,一样长,从高位开始比较
int la = a.length() ;
int lb = b.length() ;
if(la < lb){
return 2 ;
}else if(la > lb){
return 1 ;
}else if(la == lb){
for(int i = 0 ; i < la ; ++i){
if(a[i] < b[i]){
return 2 ;
}else if(a[i] > b[i])
return 1 ;
}
return 0;
}
}
//加法代码实现
string add(string a, string b){ //传入数据时,已经是A>B
reverse(a.begin() , a.end()) ; //反序,从低到高相加
reverse(b.begin() , b.end()) ;
int la = a.length() ;
int lb = b.length() ;
string c = "" ; //保存结果
for(int i = 0 ; i <lb ; i++){
c += a[i] + b[i] - '0' ; //每一位相加
}
if(la > lb){ //后面不变
for(int i = lb ; i <la ; i++){
c += a[i] ;
}
}
//进位实现
for(int i = 0 ; i < la-1 ; i++){
if(c[i] > '9'){ //进位
c[i] = c[i] -'9'-1 + '0' ;
c[i+1] += 1;
}
}
if(c[la-1] > '9'){
c += '1' ;
c[la-1] = c[la-1] - '9'-1 + '0' ;
}
//反序后返回
reverse(c.begin() , c.end()) ;
/*int pos ;
for(int i = 0 ; i < c.length() ; i ++){
if(c[i] != '0') {
pos = i ;
break;
}
}
c = c.substr(pos) ;*/
return c ;
}
//加法代码实现
string jian(string a , string b){
reverse(a.begin() , a.end()) ;
reverse(b.begin() , b.end()) ;
string c = "";
int la = a.length() ;
int lb = b.length() ;
/*for(int i = 0 ; i < la ; i++){
cout<<a[i] <<' ' ;
}
cout<<endl;
for(int i = 0 ; i < lb ; i++){
cout<<b[i]<<' ';
}
cout<<endl;
cout<<"1"<<endl;*/
for(int i = 0 ; i < lb ; i ++){
c += a[i] - b[i] + '0' ;
//cout<<c[i] <<' ' ;
}
for(int i = lb ; i < la ; i ++){
c += a[i] ;
//cout<<c[i]<<' ' ;
}
/*cout<<endl;
cout<<"2"<<endl;*/
for(int i = 0 ; i < la; i++){
if(c[i] <'0'){
c[i+1] -= 1 ;
c[i] = c[i] + 10 ;
}
//cout<<c[i]<<' ' ;
}
//cout<<endl;
reverse(c.begin() , c.end()) ;
int pos = 0;
for(int i = 0 ; i < la ; i ++){
if(c[i] != '0') {
pos = i ;
break;
}
}
c = c.substr(pos) ;
//reverse(c.begin() , c.end()) ;
return c ;
}
//判断各种情况的代码,具体参考思路
void solve(string a, string b){
int la = a.length() ;
int lb = b.length() ;
string at = a , bt = b ;
if(a[0] == '-'){
at = a.substr(1) ;
}else {
at = a;
}
if(b[0] == '-'){
bt = b.substr(1) ;
}else {
bt = b ;
}
if(a == "0" && b == "0"){
cout<<"0"<<endl;
}
else if(a[0] == '-' && b[0] == '-'){
if(depend(at,bt) ==1){
cout<<'-'<<add(at,bt)<<endl;
}else if(depend(at , bt) == 2){
cout<<'-'<<add(bt,at)<<endl;
}else if(depend(at,bt) == 0){
cout<<'-'<<add(at,bt)<<endl;
}
}else if(a[0] == '-' && b[0] != '-'){
if(depend(at,bt) ==1){
cout<<"-"<<jian(at,bt)<<endl;
}else if(depend(at , bt) == 2){
cout<<jian(bt,at)<<endl;
}else if(depend(at,bt) == 0){
printf("0\n") ;
}
}else if(a[0] != '-' && b[0] == '-'){
if(depend(at,bt) ==1){
cout<<jian(at,bt)<<endl;
}else if(depend(at , bt) == 2){
cout<<jian(bt,at)<<endl;
}else if(depend(at,bt) == 0){
printf("0\n") ;
}
}else if(a[0] != '0' && b[0] != '0'){
if(depend(at,bt) ==1){
cout<<add(at,bt)<<endl;
}else if(depend(at , bt) == 2){
cout<<add(bt,at)<<endl;
}else if(depend(at,bt) == 0){
cout<<add(at,bt)<<endl;
}
}
}
int main(){
string a , b ;
while(cin >> a >> b){
solve(a , b) ;
}
}