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