#include <bits/stdc++.h>
using namespace std;
const int N = 1e7 + 9;
long long dp[N];
int n, x, y;
int main() {
  scanf("%d%d%d", &n, &x, &y);
  dp[0] = 0;
  for (int i = 1; i < N; i++) {
    dp[i] = min(dp[i - 1] + x, 1LL * i * x);
    if (i % 2 == 0)
      dp[i] = min(dp[i], dp[i / 2] + y);
    else
      dp[i] = min(dp[i], dp[(i + 1) / 2] + x + y);
  }
  printf("%lld\n", dp[n]);
}
