#include <bits/stdc++.h>
using namespace std;
long long dp[20000010];
int main() {
  dp[0] = 0;
  int n, x, y, done;
  scanf("%d%d%d", &n, &x, &y);
  dp[1] = x;
  done = 1;
  while (done < n) {
    int lo = done + 1, hi = 2 * done;
    for (int i = lo; i <= hi; i++) {
      if (i % 2 == 1)
        dp[i] = 1e18;
      else
        dp[i] = dp[i / 2] + y;
    }
    for (int i = lo; i <= hi; i++) {
      dp[i] = min(dp[i], dp[i - 1] + x);
    }
    for (int i = hi - 1; i >= lo; i--) {
      dp[i] = min(dp[i + 1] + x, dp[i]);
    }
    done *= 2;
  }
  printf("%lld\n", dp[n]);
  return 0;
}
