#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <vector>
#include <string>
#include <queue>
#include <deque>
#include <list>
#include <stack>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <algorithm>

#define int long long
#define MOD7 1000000007
#define MOD9 1000000009

#define rep(i, n) for (int i = 0; i < (n); i++)
#define itrep(i, a) for (auto i = (a).begin(); i != (a).end(); i++)
#define REP(i, a, n) for (int i = (a); i <= (n); i++)
#define all(a) (a).begin(), (a).end()
#define mp(a, b) make_pair((a), (b))

using namespace std;

int dx[4] = { 1, 0, -1, 0 };
int dy[4] = { 0, -1, 0, 1 };

template<class T> void inputVector(vector<T>& v, int n) {
    v.resize(n);
    for (int i = 0; i < v.size(); i++) cin >> v[i];
}

set<pair<int, int>> visit;
priority_queue<pair<int, pair<int, int>>> q;

signed main() {
	int N, C, V;
	cin >> N >> C >> V;

	q.push(mp(0, mp(1, 0)));
	while (true) {
		auto now = q.top(); q.pop();
		int nowCost = -now.first;
		int nowLen = now.second.first;
		int nowCopy = now.second.second;
		if (nowLen >= N) {
			cout << nowCost << endl;
			break;
		}
		if (visit.find(now.second) != visit.end()) continue;
		visit.insert(now.second);
		if (nowLen != nowCopy) {
			q.push(mp(-(nowCost + C), mp(nowLen, nowLen)));
		}
		q.push(mp(-(nowCost + V), mp(nowLen + nowCopy, nowCopy)));
	}

    return 0;
}