#include <algorithm>
#include <cstdlib>
#include <iostream>
#include <vector>
#include <math.h>
using namespace std;
#define int long long

signed main() {
	int N;
	int c, v;
	cin >> N;
	cin >> c >> v;
	vector<vector<int> > dp(20);
	for (int j = 0; j < 20; j++) {
		dp[j].resize(N, 10000000);
	}
	dp[1][1] = 0;
	int res = 100000000;
	int t;
	for (int i = 1; i < N; i++) {
		for (int j = 1; j < 20; j++) {
			if (j < 19) {
				t = i + (1 << (j - 1));
				if (t < N) {
					dp[j + 1][t] = min(dp[j + 1][t], dp[j][i] + c + v);
				}
				else {
					res = min(res, dp[j][i] + c + v);
				}
				
			}
			if (j > 1) {
				t = i + (1 << (j - 2));
				if (t < N) {
					dp[j][t] = min(dp[j][t], dp[j][i] + v);
				}
				else {
					res = min(res, dp[j][i]  + v);
				}
			}
		}
	}
	/*
	for (int i = 1; i < N; i++) {
		for (int j = 1; j < 5; j++) {
			cerr << dp[j][i] << " ";
		}
		cerr << endl;
	}
	*/
	cout << res << endl;
	return 0;
}