#include <bits/stdc++.h>
using namespace std;
const int MOD = 998244353;
const int N = 1000005;
const double PI = 4 * atan(1);
const double eps = 1e-7;
const long long oo = 1e18;
const int AlPHA = 26, B = 30;
long long n, x, y;
long long dp[10000005];
int main() {
  ios::sync_with_stdio(0);
  cin >> n >> x >> y;
  dp[1] = x;
  for (int i = 2; i <= n; i++) {
    if (i % 2 == 0) {
      dp[i] = (dp[i - 1] + x < dp[i / 2] + y ? dp[i - 1] + x : dp[i / 2] + y);
    } else {
      dp[i] =
          (dp[i - 1] + x < dp[(i + 1) / 2] + y + x ? dp[i - 1] + x
                                                   : dp[(i + 1) / 2] + y + x);
    }
  }
  cout << dp[n];
  return 0;
}
