#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
const int MOD = 1e9 + 7;
const ll INF = LLONG_MAX / 2;

int main() {
	int N; ll x, y; cin >> N >> x >> y;
	vector<ll> dp(N * 2 + 1, INF);
	dp[1] = 0;
	for (int i = 1; i <= N; i++)
		for (int t = 2; t * i <= N * 2; t++)
			dp[t * i] = min(dp[t * i], dp[i] + x + (t - 1) * y);
	ll ans = INF;
	for (int i = N; i <= N * 2; i++)
		ans = min(ans, dp[i]);
	cout << ans << endl;
}