#include <bits/stdc++.h>
using namespace std;
using ll = long long;

int main(){
    ll n, a, b, c1, c2, ans = 1ll << 62;
    cin >> n >> a >> b;
    c1 = n / 2, c2 = n - c1;
    ans = min(ans, -a * (n - 1) + b * (c2 - c1));
    ans = min(ans, -a * (n - 1) + b * (c1 - c2));
    ans = min(ans, a * (n - 1) + b * (- n));
    if(n <= 1000000){
        for(ll i = 0; i <= n; i++){
            ll d = min(2 * min(i, n - i), n - 1);
            ans = min(ans, a * (-d + (n - 1 - d)) + b * (i - (n - i)));
        }
    }
    cout << ans << endl;
}