#include using namespace std; //#include //using namespace atcoder; //using mint = modint1000000007; //using mint = modint998244353; std::chrono::time_point start; template bool chmax(T &u, const T z) { if (u < z) {u = z; return true;} else return false; } template bool chmin(T &u, const T z) { if (u > z) {u = z; return true;} else return false; } #define ll long long #define rep(i, n) for (ll i = 0; i < (ll)(n); i++) typedef pair P; ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; } ll lcm(ll a, ll b){return a * b / gcd(a, b);} int main(){ ll d,a,b; cin>>d>>a>>b; ll ans=LLONG_MAX; rep(i,d+1){ ans=min(ans,i*a+(d-i)*b); } cout<