#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <queue>
#include <array>
using i64 = long long;
using u64 = unsigned long long;
#define rep(i,n) for(int i=0; i<int(n); i++)
#define repr(i,n) for(int i=int(n)-1; i>=0; i--)
const i64 INF = 1001001001001001001;
const char* yn(bool x){ return x ? "Yes" : "No"; }
template<typename A> void chmin(A& l, const A& r){ if(r < l) l = r; }
template<typename A> void chmax(A& l, const A& r){ if(l < r) l = r; }
template<typename A> using nega_queue = std::priority_queue<A,std::vector<A>,std::greater<A>>;
using namespace std;

void testcase(){
    i64 N, A, B, C; cin >> N >> A >> B >> C;
    i64 K = 0; {
        i64 f = 1;
        while(INF / B >= f){
            K++;
            f *= B;
        }
    }
    i64 Nfactor = 0; {
        i64 n = N;
        for(i64 p=2; p*p<=n; p++) if(n%p == 0){
            i64 cnt = 0;
            while(n%p == 0){ n /= p; cnt++; }
            i64 targetq = 0;
            for(i64 q=1; q<=cnt; q++){
                i64 qq = q;
                i64 qc = 0;
                while(qq){ qc += qq; qq /= p; }
                if(qc >= cnt){ targetq = q; break; }
            }
            chmax(Nfactor, p * targetq);
        }
        chmax(Nfactor, n);
    }

    nega_queue<pair<i64,i64>> que;
    vector<i64> dist(N*2, INF);
    i64 ans = A * (N-1);
    auto upd = [&](i64 v, i64 d){
        if(dist[v] > d){
            dist[v] = d;
            que.push({ d, v });
        }
    };
    vector<i64> fact(N);
    fact[0] = 1;
    auto xmod = [&](i64 a){
        if(a >= N) return (a-N) % N + N;
        return a;
    };
    for(i64 i=1; i<N; i++){
        fact[i] = xmod(fact[i-1] * i);
    }
    upd(1, 0);
    while(que.size()){
        auto [d, v] = que.top(); que.pop();
        if(dist[v] != d) continue;
        {
            if(v % N == N-1){
                chmin(ans, d + A);
            } else {
                upd(v+1, d + A);
            }
        }
        if(v < N){
            if(fact[v] % N == 0){
                chmin(ans, d + C);
            } else {
                upd(fact[v], d + C);
            }
        } else {
            chmin(ans, d + C);
        }
        {
            i64 w = v, dd = B;
            for(i64 k=2; k<=K; k++){
                dd *= B; w = xmod(w*v);
                upd(w, d + dd);
            }
        }
    }
    cout << ans << endl;
}

int main(){
    ios::sync_with_stdio(false); cin.tie(nullptr);
    #ifdef NACHIA
    int T; cin >> T; for(int t=0; t<T; T!=++t?(cout<<'\n'),0:0)
    #endif
    testcase();
    return 0;
}