#include <bits/stdc++.h>
using namespace std;
int n, x, y;
long long f[10000010];
int main() {
  while (cin >> n >> x >> y) {
    memset(f, 0, sizeof(f));
    for (int i = 1; i <= n; i++) {
      if (i % 2) {
        f[i] = min(f[(i + 1) / 2] + x + y, f[i - 1] + x);
      } else {
        f[i] = min(f[i / 2] + y, f[i - 1] + x);
      }
    }
    cout << f[n] << endl;
  }
  return 0;
}
