#include <bits/stdc++.h>   using namespace std;   void reader() {}   const long long MOD = 1e9 + 7;   const long long N = 3e7 + 5;   const long long inf = 1e18;   long long Set(long long qq, long long pos) { return (qq | (1 << pos)); }   long long chk(long long qq, long long pos) { return (qq & (1 << pos)); }   void solve() {     long long n, first, second;     cin >> n >> first >> second;     vector<long long> dp(n + 1);     dp[1] = first;     dp[0] = 0;     for (long long i = 2; i <= n; i++) {       if (i % 2 == 0)         dp[i] = min(dp[i - 1] + first, dp[i / 2] + second);       else         dp[i] = min(dp[(1 + i) / 2] + first + second, dp[i - 1] + first);     }     cout << dp[n];   }   signed main() {     ios::sync_with_stdio(0);     cin.tie(0);     cout.tie(0);     reader();     solve();   }   