#include <bits/stdc++.h>
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
using namespace std;
signed main() {
  long long int n, x, y;
  cin >> n >> x >> y;
  vector<long long int> dp(2 * n + 1, 1e18);
  dp[1] = x;
  for (long long int i = 2; i <= 2 * n; i++) {
    if (i % 2 == 0)
      dp[i] = min(dp[i - 1] + x, dp[i / 2] + y);
    else
      dp[i] = min(dp[i - 1] + x, dp[(i + 1) / 2] + y + x);
  }
  long long int ans = dp[n];
  for (long long int i = n + 1; i <= 2 * n; i++)
    ans = min(ans, dp[i] + (i - n) * x);
  cout << ans << "\n";
  return 0;
}
