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