#include <bits/stdc++.h>
using namespace std;
const int maxn = 10000003;
long long f[maxn];
int n, x, y;
int main() {
  scanf("%d%d%d", &n, &x, &y);
  memset(f, 0x3f, sizeof(f));
  f[0] = 0;
  for (int i = 1; i <= n; ++i) {
    if (i & 1)
      f[i] = min(f[i - 1] + x, f[(i + 1) / 2] + x + y);
    else
      f[i] = min(f[i - 1] + x, f[i / 2] + y);
  }
  printf("%I64d\n", f[n]);
}
