#include <bits/stdc++.h>
using namespace std;
const long long N = 1e7 + 6;
long long x, y, n;
long long f[N];
inline long long read() {
  long long x = 0, f = 1;
  char c = getchar();
  while (c < '0' || c > '9') {
    if (c == '-') f = -f;
    c = getchar();
  }
  while (c >= '0' && c <= '9') {
    x = (x << 3) + (x << 1) + (c ^ 48);
    c = getchar();
  }
  return x * f;
}
signed main() {
  n = read();
  x = read();
  y = read();
  for (long long i = 1; i <= n; i++)
    f[i] = min(f[i - 1] + x, f[i + 1 >> 1] + y + x * (i & 1));
  printf("%lld", f[n]);
  return 0;
}
