#include <bits/stdc++.h>   using namespace std;   long long n, x, y;   long long dp[10000005];   int main(void) {     scanf( %lld%lld%lld , &n, &x, &y);     dp[1] = x;     for (int i = 2; i <= n; ++i) {       if (i & 1) {         dp[i] = min(dp[i - 1] + x, dp[(i + 1) >> 1] + x + y);       } else         dp[i] = min(dp[i - 1] + x, dp[i >> 1] + y);     }     printf( %lld n , dp[n]);   }   