#include<bits/stdc++.h>

using namespace std;
struct node
{
    long long u,v,w,nxt;
}e[5];
struct Queue
{
    long long dis,v;
    bool operator<(const Queue t)const
    {
        return t.dis<dis;
    }
};
long long a,b,head[5],pos,dis[5];
bool vis[5];
priority_queue<Queue> q;
void Insert(long long u,long long v,long long w)
{
    e[++pos]={u,v,w,head[u]};
    head[u]=pos;
}
void Dijkstra(long long u)
{
    memset(dis,0x3f,sizeof(dis));
    memset(vis,false,sizeof(vis));
    q.push({0,u});
    dis[u]=0;
    while(q.size())
    {
        auto cur=q.top();
        q.pop();
        if(vis[cur.v])
            continue;
        vis[cur.v]=true;
        for(int i=head[cur.v];i;i=e[i].nxt)
        {
            if(dis[e[i].v]>dis[cur.v]+e[i].w)
            {
                dis[e[i].v]=dis[cur.v]+e[i].w;
                q.push({dis[e[i].v],e[i].v});
            }
        }
    }
}
long long read()
{
  long long x = 0, f = 1;
  char ch = getchar();
  while (ch < '0' || ch > '9')
  {
    if (ch == '-')
      f = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9')
  {
    x = (x << 1) + (x << 3) + (ch ^ 48);
    ch = getchar();
  }
  return x * f;
}
int main()
{
    a=read();
    b=read();
    Insert(1,2,a);
    Insert(2,3,b);
    Dijkstra(1);
    printf("%lld",dis[3]);
    return 0;
}