bool M1;
#include<iostream>
#include<algorithm>
#include<cstring>
#include<cstdlib>
#include<climits>
#include<iomanip>
#include<cassert>
#include<random>
#include<cstdio>
#include<vector>
#include<bitset>
#include<stack>
#include<queue>
#include<deque>
#include<cmath>
#include<ctime>
#include<map>
#include<set>
//#include<ext/pb_ds/assoc_container.hpp>
//#include<ext/pb_ds/hash_policy.hpp>
//#include<ext/pb_ds/priority_queue.hpp>
#define fi first
#define se second
#define LD double
#define ll long long
#define Vector Point
#define I128 __int128
#define ull unsigned ll
#define pii pair<int,int>
#define pb(x) push_back(x)
#define syt cerr<<"sytakioi\n"
#define F(i,a,b) for(int i=a,i##end=b;i<=i##end;++i)
#define UF(i,a,b) for(int i=a,i##end=b;i>=i##end;--i)
#define look_memory cerr<<abs(&M2-&M1)/1024.0/1024<<'\n'
#define rd_i(l,r) uniform_int_distribution<int>(l,r)(rd)
#define rd_r(l,r) uniform_real_distribution<double>(l,r)(rd)
#define look_time cerr<<(clock()-Time)*1.0/CLOCKS_PER_SEC<<'\n'
using namespace std;
//using namespace __gnu_cxx;
mt19937 rd(time(0));
const int N=105;
ll n,a,b;
I128 ans;
inline void solve(int x){
	I128 res=a*x;
	I128 l=1,r=n,val=1;
	while(l<=r){
		I128 mid=(l+r)>>1,sum=1;
		bool f=0;
		F(i,1,x){
			sum*=mid;
			if(sum>n) f=1;
		}
		if(!f) l=mid+1,val=mid;
		else r=mid-1;
	}
	I128 sum=1,num=(val-1)*x;
	F(i,1,x) sum*=val;
	while(sum<=n) sum=sum/val*(val+1),++num;
//	cout<<x<<' '<<(ll)res<<' '<<(ll)(res+num*b)<<'\n';
	if(x==1) ans=res+num*b;
	else ans=min(ans,res+num*b);
}
bool M2;
int main(){
	int Time=clock();
	look_memory;
	cin.tie(nullptr)->sync_with_stdio(false);
	cin>>n>>a>>b;
	F(i,1,64) solve(i);
	cout<<(ll)ans<<'\n';
	look_time;
	return 0;
}