#include <iostream>
#include <cmath>
#include <vector>
using namespace std;

int main() {
	int n, c, v;
	cin >> n;
	cin >> c >> v;
	vector<int> dp {-1, -1, c+v, c+v+v};

	if (n != 2 || n != 3) {
		for (int i = 4; i <= n; ++i) {
			dp[i] = min(dp[ceil(i/2.0)]+c+v, c+(i-1)*v);
		}
	}
	cout << dp[n] << endl;
}