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