#include <bits/stdc++.h>
using namespace std;
const int MAX_N = 1e7 + 11;
int n, x, y;
long long DP[MAX_N];
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0), cout.tie(0);
  cin >> n >> x >> y;
  DP[1] = x;
  for (int i = 2; i <= n; ++i)
    DP[i] = min(DP[i - 1] + x, DP[(i + 1) / 2] + y + (i % 2) * x);
  cout << DP[n] << endl;
  return 0;
}
