#include <cstdio>
#include <cstdlib>

struct node {
	int a, b, c, d, e, f, g, h, i, j, A[200];
	node() : a(rand()), b(rand()), c(rand()), d(rand()), e(rand()), f(rand()), g(rand()), h(rand()),
		i(rand()), j(rand()) {
		for (int ii = 0; ii < 200; ++ii)
			A[ii] = rand();
	}
	int s() {
		int ans = a + b + c + d + e + f + g + h + i + j;
		for (int ii = 0; ii < 200; ++ii)
			ans += A[ii];
		return ans;
	}
	int D() {
		int ans = a + b + c + d + e + f + g + h + i + j;
		ans <<= 1;
		for (int ii = 0; ii < 200; ++ii)
			ans += (A[ii] << 1);
		return -(ans >> 1);
	}
};

int main() {
	freopen("adunare.in", "r", stdin);
	freopen("adunare.out", "w", stdout);
	int a, b;
	scanf("%d%d", &a, &b);
	node *t = new node();
	a += t->s();
	a += t->D();
	delete t;
	printf("%d\n", a + b);
	return 0;
}