#include #include #include using namespace atcoder; using mint = modint998244353; using namespace std; #define rep(i,n) for (int i = 0; i < (n); ++i) #define Inf32 1000000001 #define Inf64 4000000000000000001 long long N,A,B; long long get(long long X){ long long Y = N-X; long long ret = (X-Y) * B; if(X==0||Y==0){ ret += (N-1) * A; } else if(X==Y){ ret -= (N-1) * A; } else{ long long t = min(X,Y); t *= 2; ret -= t * A; ret += (N-1-t) * A; } return ret; } int main() { cin>>N>>A>>B; long long ans = Inf64; for(long long i=0;i<=min(1000LL,N);i++)ans = min(ans,get(i)); for(long long i=0;i<=min(1000LL,N);i++)ans = min(ans,get(N-i)); for(long long i=0;i<=min(1000LL,N/2);i++)ans = min(ans,get(N/2-i)); for(long long i=0;i<=min(1000LL,N/2);i++)ans = min(ans,get(N/2+i)); cout<