#include <bits/stdc++.h>
using namespace std;
long long int dp[10000007];
int main() {
  long long int i, j, k, n, m, t, x, y;
  cin >> n >> x >> y;
  for (i = 0; i <= n; i++) dp[i] = 1e18;
  dp[1] = x;
  for (i = 2; i <= n; i++) {
    if (i & 1) {
      dp[i] = min(dp[i], min(dp[i - 1] + x, dp[(i + 1) / 2] + y + x));
    } else {
      dp[i] = min(dp[i], min(dp[i - 1] + x, dp[i / 2] + y));
    }
  }
  cout << dp[n];
  return 0;
}
