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