#include<cstdio>
#include<iostream>
#include<algorithm>
#include<string>
#include<queue>
#include<vector>
#include<functional>
#include<cmath>
#include<map>
#include<stack>
#include<set>
#include<numeric>
#include<limits>
#include<iterator>

#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()

using namespace std;
typedef long long ll;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<ll, char> plc;

int dp[500010];

int main()
{
	int n,c,v;
	cin >> n >> c >> v;

	dp[1] = 0;
	dp[2] = c+v;
	dp[3] = c + 2 * v;

	for (int i = 4; i <= n; i++){
		if (i % 2 == 0)
			dp[i] = min(dp[i / 2] + c + v,dp[i-1]+v);
		else
			dp[i] = min(dp[i / 2 + 1] + c + v,dp[i-1]+v);
	}
	cout << dp[n] << endl;
	return 0;
}