#define divn(x) (nv*(x)>>36)
#define modn(x) ({unsigned long long y=(x)-divn(x)*n;y-=y<n?0:n;})

ll@(n,a,b,c);
ull nv=(1ull<<36)/n;
ll fac[2d5+1]{1},fn=0,f=1;
rep(i,1,n){
	f*=i;
	if(!fn&&f>=n){
		fn=i;
	}
	fac[i]=f=modn(f);
}
DijkstraHeap<ll>h;
h.malloc(n,1);
h.change(1,0);
while(1){
	ll x=h.pop();
	ll v=h.val[x];
	if(x==0){
		wt(v);
		exit(0);
	}
	h.change(x+1<n?x+1:0,v+a);
	ll bb=b;
	ll xx=x;
	while(bb*=b,xx*=x,bb<(n-1)*a){
		if(xx>=n){
			h.change(0,v+bb+c);
		}
		xx=modn(xx);
		h.change(xx,v+bb);
	}
	h.change(fac[x],v+c);
	if(x>=fn){
		h.change(0,v+2c);
	}
}