#include<bits/stdc++.h>
using namespace std;
using ll = long long;

int main(){
  ll N,A,B,C;
  cin>>N>>A>>B>>C;
  vector fac(N,1ll),bigN(N,0ll);
  for(int i=1;i<N;i++){
    bigN[i]=bigN[i-1];
    fac[i]=fac[i-1]*i%N;
    if(fac[i-1]*i>=N)bigN[i]=1;
  }
  vector dist(N+1,(ll)1e18);
  priority_queue<array<ll,2>,vector<array<ll,2>>,greater<array<ll,2>>>pq;
  dist[1]=0;
  pq.push({0,1});
  while(pq.size()){
    auto [d,v]=pq.top();
    pq.pop();
    if(d>dist[v])continue;
    if(v==N){
      // 操作3
      if(dist[0]>d+C){
        dist[0]=d+C;
        pq.push({d+C,0});
      }
    }else{
      // 操作1
      if(v+1>=N&&dist[N]>d+A){
        dist[N]=d+A;
        pq.push({d+A,N});
      }
      if(dist[(v+1)%N]>d+A){
        dist[(v+1)%N]=d+A;
        pq.push({d+A,(v+1)%N});
      }

      // 操作2
      {
        ll b=B,v2=v;
        bool f=0;
        while(b<A*(N-1)){
          if(v2>=N){
            f=1;
            v2%=N;
          }
          if(f){
            if(dist[N]>d+b){
              dist[N]=d+b;
              pq.push({d+b,N});
            }
            v2%=N;
          }
          if(dist[v2]>d+b){
            dist[v2]=d+b;
            pq.push({d+b,v2});
          }
          v2*=v;
          b*=B;
        }
      }
      // 操作3
      if(dist[fac[v]]>d+C){
        dist[fac[v]]=d+C;
        pq.push({d+C,fac[v]});
      }
      if(bigN[v]&&dist[N]>d+C){
        dist[N]=d+C;
        pq.push({d+C,N});
      }
    }
  }
  cout<<dist[0]<<'\n';
}