#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for(int i=0;i<(int)(n);i++)

bool mck(ll x,ll y,ll m){
	double dx=x,dy=y;
	dx*=dy;
	return dx>(double)m;
}

int main(){
	ll n,a,b,c;
	cin>>n>>a>>b>>c;
	vector<ll> fac(n,1);
	ll ud=-1;
	for(ll i=2;i<n;i++){
		if(ud==-1){
			fac.at(i)=fac.at(i-1)*i;
			if(fac.at(i)>=n){
				ud=i;
				fac.at(i)%=n;
			}
		}else{
			fac.at(i)=fac.at(i-1)*i%n;
		}		
	}
	vector<ll> cs(n+1,1e18);
	priority_queue<pair<ll,ll>,vector<pair<ll,ll>>,greater<pair<ll,ll>>> pq;
	pq.push({0,1});
	while(!pq.empty()){
		auto[sc,v]=pq.top();
		pq.pop();
		if(cs.at(v)!=1e18) continue;
		cs.at(v)=sc;
		if(v==0) break;
		if(v==n){
			pq.push({sc+c,0});
			continue;
		}
		if(cs.at((v+1)%n)==1e18){
			pq.push({sc+a,(v+1)%n});
		}
		{
			ll nx=v;
			ll pw=b;
			int flg=0;
			for(int k=2;1;k++){
				nx=(nx*v);
				if(nx>=n){
					nx%=n;
					flg=1;
				}
				if(mck(pw,b,a*n)) break;
				pw*=b;
				if(cs.at(nx)==1e18){
					pq.push({sc+pw,nx});
				}
				if(flg&&cs.at(n)==1e18){
					pq.push({sc+pw,n});
				}
			}
		}
		{
			int nx=fac.at(v);
			if(cs.at(nx)==1e18){
				pq.push({sc+c,nx});
			}
			if(ud<=v&&cs.at(n)==1e18){
				pq.push({sc+c,n});
			}
		}
	}
	cout<<cs.at(0)<<endl;
}