#include<iostream>#include<cstdio>#include<cstring>#include<cmath>using namespace std;#define ll long longconst int N=1e7+5;ll dp[N];ll minn(ll a,ll b){return a<b?a:b;}int main(){    ll n,x,y;    while(cin>>n>>x>>y)    {        dp[1]=x;        for(int i=2; i<=n; i++)        {            if(i%2==0) dp[i]=minn(dp[i-1]+x,dp[i/2]+y);            else dp[i]=minn(dp[i-1]+x,minn(dp[i/2]+x+y,dp[i/2+1]+x+y));        }        cout<<dp[n]<<endl;    }    return 0;}