#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vint;
typedef pair<int,int> pint;
typedef vector<pint> vpint;
#define rep(i,n) for(int i=0;i<(n);i++)
#define REP(i,n) for(int i=n-1;i>=(0);i--)
#define reps(i,f,n) for(int i=(f);i<(n);i++)
#define each(it,v) for(__typeof((v).begin()) it=(v).begin();it!=(v).end();it++)
#define all(v) (v).begin(),(v).end()
#define eall(v) unique(all(v), v.end())
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define chmax(a, b) a = (((a)<(b)) ? (b) : (a))
#define chmin(a, b) a = (((a)>(b)) ? (b) : (a))
const int MOD = 1e9 + 7;
const int INF = 1e9;
const ll INFF = 1e18;

int main(void) {
	int n; cin >> n;
	int c, v; cin >> c >> v;
	ll ans = INFF;
	reps(i, 1, 30) {
		ll cnt = 1;
		ll tans = 0;
		ll now = 1;
		rep(j, i) {
			cnt += now;
			now *= 2;
		}
		tans += (c + v) * i;
		// printf("cnt %lld tans %lld\n", cnt, tans);
		if(cnt < n) {
			ll d = n - cnt;
			ll k = now / 2;
			// printf("now %lld k %lld\n", now, k);
			tans += ((d + k - 1) / k) * v;
		}
		// printf("i %d tans %lld \n", i, tans);
		chmin(ans, tans);
	}
	printf("%lld\n", ans);
	return 0;
}