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