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