/*#include <stdio.h>
#include <algorithm>
#include <string.h>
#include <stdlib.h>
#include <assert.h>
FILE *f=fopen("int.in","r");
FILE *g=fopen("int.out","w");
int n;
using namespace std;

struct interv{
	int st;
	int dr;
};
interv a[50001];
int v[500001];

int cmp(register interv c,register interv d){
	return c.st<d.st;
}

void imp(register int s,register int d,int *pozitie_pivot){
	register int i,j,k,k1,piv;
	assert(d>=s);
	i=s+1;
	j=d;
	piv=a[s].st;
	do{
		while(i<=d && a[i].st<piv)
			i++;
		while(j>=s && a[j].st>piv)
			j--;
		if(i<j){
			k=a[i].st;
			a[i].st=a[j].st;
			a[j].st=a[i].st;
			k1=a[i].dr;
			a[i].dr=a[j].dr;
			a[j].dr=k1;
		}
	}while(i<=j);
	*pozitie_pivot=j;
	a[s].st=a[j].st;
	a[j].st=piv;
}

void quicksort(int s,int d){
	int pp;
	if(s<d){
		imp(s,d,&pp);
		quicksort(s,pp-1);
		quicksort(pp+1,d);
	}
}

bool ver(register int c,register int d){
	if(a[c].dr>a[d].st)
		return false;
	return true;
}



int main(void){
	register int i;
	int nr=0,nrmax=-1,max;
	
	fscanf(f,"%d",&n);
	for(i=1;i<=n;i++){
		fscanf(f,"%d %d",&a[i].st,&a[i].dr);
	}
	fclose(f);
	
	sort(a+1,a+n+1,cmp);
	
	//quicksort(1,n);
	
	max=n;
	for(i=n;i>=1;i--){
		v[i]=1;
		if(!ver(i,max))
			for(register int j=i+1;j<=n;j++){
				if(ver(i,j)){
					v[i]=v[j]+1;
					break;
				}
			}
		else
			v[i]=v[max]+1;
		if(v[i]>nrmax){
			nrmax=v[i];
			max=i;
		}	
	}
	fprintf(g,"%d",nrmax);
*/
#include <stdio.h>

FILE *f;
long int a,b;

int main(){
	 f=fopen("adunare.in","r");
	 fscanf(f,"%ld %ld",&a,&b);
	 fclose(f);
	 f=fopen("adunare.out","w");
	 a+=b;
	 fprintf(f,"%ld",a);
	 fclose(f);
return 0;
}
/*	return 0;
}*/