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