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