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