#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e7 + 5;
long long dp[maxn];
int main() {
  int n, x, y;
  scanf("%d%d%d", &n, &x, &y);
  for (int i = 0; i <= n + 1; i++) dp[i] = 1e18;
  dp[1] = x;
  for (int i = 2; i <= n; i++) {
    if (i % 2 == 0) {
      dp[i] = min(dp[i], dp[i / 2] + 1ll * y);
      dp[i] = min(dp[i], dp[i - 1] + x);
    } else {
      dp[i] = min(dp[i], min(dp[i / 2], dp[(i + 1) / 2]) + 1ll * x + 1ll * y);
      dp[i] = min(dp[i], dp[i - 1] + x);
    }
  }
  cout << dp[n] << endl;
}
