#include <bits/stdc++.h>
const long long int INF = 200000001000, MOD = 1e9 + 7, MAXN = 10000;
const double EPS = 0.0000001;
using namespace std;
int ax[8] = {0, 0, 1, -1, -1, 1, -1, 1};
int ay[8] = {1, -1, 0, 0, 1, -1, -1, 1};
long long int dp[20000002];
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  cout.tie(nullptr);
  long long int n, x, cop;
  cin >> n >> x >> cop;
  for (long long int i = 0; i < 20000002; i++) dp[i] = INF;
  dp[0] = 0;
  for (long long int i = 0; i <= n; i++) {
    dp[i + 1] = min(dp[i + 1], dp[i] + x);
    dp[2 * i] = min(dp[2 * i], dp[i] + cop);
  }
  for (long long int i = 2 * n - 1; i >= 0; i--) {
    dp[i] = min(dp[i], dp[i + 1] + x);
  }
  for (long long int i = 0; i <= n; i++) {
    dp[i + 1] = min(dp[i + 1], dp[i] + x);
    dp[2 * i] = min(dp[2 * i], dp[i] + cop);
  }
  for (long long int i = 2 * n - 1; i >= 0; i--) {
    dp[i] = min(dp[i], dp[i + 1] + x);
  }
  for (long long int i = 0; i <= n; i++) {
    dp[i + 1] = min(dp[i + 1], dp[i] + x);
    dp[2 * i] = min(dp[2 * i], dp[i] + cop);
  }
  for (long long int i = 2 * n - 1; i >= 0; i--) {
    dp[i] = min(dp[i], dp[i + 1] + x);
  }
  for (long long int i = 0; i <= n; i++) {
    dp[i + 1] = min(dp[i + 1], dp[i] + x);
    dp[2 * i] = min(dp[2 * i], dp[i] + cop);
  }
  for (long long int i = 2 * n - 1; i >= 0; i--) {
    dp[i] = min(dp[i], dp[i + 1] + x);
  }
  for (long long int i = 0; i <= n; i++) {
    dp[i + 1] = min(dp[i + 1], dp[i] + x);
    dp[2 * i] = min(dp[2 * i], dp[i] + cop);
  }
  for (long long int i = 2 * n - 1; i >= 0; i--) {
    dp[i] = min(dp[i], dp[i + 1] + x);
  }
  for (long long int i = 0; i <= n; i++) {
    dp[i + 1] = min(dp[i + 1], dp[i] + x);
    dp[2 * i] = min(dp[2 * i], dp[i] + cop);
  }
  for (long long int i = 2 * n - 1; i >= 0; i--) {
    dp[i] = min(dp[i], dp[i + 1] + x);
  }
  for (long long int i = 0; i <= n; i++) {
    dp[i + 1] = min(dp[i + 1], dp[i] + x);
    dp[2 * i] = min(dp[2 * i], dp[i] + cop);
  }
  for (long long int i = 2 * n - 1; i >= 0; i--) {
    dp[i] = min(dp[i], dp[i + 1] + x);
  }
  cout << dp[n];
}
