#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
int n = 2;
int a[3];
struct node{
    int l,r;
    int sum;
}tr[3];
void pushup(int u){
    tr[u].sum = tr[u << 1].sum + tr[u << 1 | 1].sum;
}
void build(int u,int l,int r){
    tr[u] = {l,r};
    if(l == r) return ;
    else{
        int mid = l + r >> 1;
        build(u << 1,l,mid);
        build(u << 1 | 1,mid+1,r);
        pushup(u);
    }
}
void modify(int u,int x,int k){
    if(tr[u].l == x && tr[u].r == x) tr[u] = {x,x,k};
    else{
        int mid = tr[u].l + tr[u].r >> 1;
        if(x <= mid) modify(u << 1,x,k);
        else modify(u << 1 | 1,x,k);
        pushup(u);
    }
}
int query(int u,int l,int r){
    if(tr[u].l >= l && tr[u].r <= r) return tr[u].sum;
    else{
        int mid = tr[u].l + tr[u].r >> 1;
        int v = 0;
        if(l <= mid) v += query(u << 1,l,r);
        if(r > mid) v += query(u << 1 | 1,l,r);
        return v;
    }
}
int main()
{
    build(1,1,n);
    for(int i=1;i<=n;i++){
        scanf("%d",&a[i]);
        modify(1,i,a[i]);
    }
    printf("%d",query(1,1,n));
    return 0;
}