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