#include <bits/stdc++.h>
using namespace std;
const int N = 1e7 + 5;
int n, x, y;
long long dp[N];
inline int read() {
  int f = 1, x = 0;
  char ch = getchar();
  while (ch > '9' || ch < '0') {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') {
    x = x * 10 + ch - '0';
    ch = getchar();
  }
  return f * x;
}
int main() {
  n = read(), x = read(), y = read();
  for (int i = (1), iend = (n); i <= iend; i++) {
    if (i & 1)
      dp[i] =
          min(dp[i - 1] + x, min(dp[i >> 1] + x + y, dp[(i + 1) >> 1] + x + y));
    else
      dp[i] = min(dp[i - 1] + x, dp[i >> 1] + y);
  }
  printf("%lld", dp[n]);
  return 0;
}
