#include <bits/stdc++.h>
using namespace std;
const long long inf = 1e18;
long long dp[10000005], sol = 0;
int main() {
  int n, i;
  long long x, y;
  scanf("%d%I64d%I64d", &n, &x, &y);
  for (i = 1; i <= 10000005; i++) dp[i] = inf;
  dp[1] = x;
  for (i = 2; i <= n; i++) {
    dp[i] = min(dp[i], dp[i - 1] + x);
    if (i % 2 == 0) dp[i] = min(dp[i], dp[i / 2] + y);
    if (i % 2 == 1) {
      dp[i] = min(dp[i], dp[(i - 1) / 2] + y + x);
      dp[i] = min(dp[i], dp[(i + 1) / 2] + y + x);
    }
  }
  printf("%I64d\n", dp[n]);
  return 0;
}
