import heapq
N,A,B,C=map(int,input().split())
fac=[1]*N
fac_over=[0]*N
for i in range(1,N):
  fac[i]=fac[i-1]*i
  fac_over[i]=fac_over[i-1]
  if fac[i]>=N:
    fac[i]%=N
    fac_over[i]=1

dist=[N*A]*N*2
dist[1]=0
q=[(0,1)]
while q:
  d,v=heapq.heappop(q)
  ov=v//N
  v%=N
  if dist[v]<d:
    continue
  # 操作1
  if dist[(v+1)%N+N*ov]>d+A:
    dist[(v+1)%N+N*ov]=d+A
    heapq.heappush(q,(d+A,(v+1)%N+N*ov))
  
  # 操作2
  b,v2=B,v
  ov2=ov
  while d+b<N*A:
    if ov2:
      if dist[v2+N]>d+b:
        dist[v2+N]=d+b
        heapq.heappush(q,(d+b,v2+N))
    else:
      if dist[v2]>d+b:
        dist[v2]=d+b
        heapq.heappush(q,(d+b,v2))
    b*=B
    v2*=v
    if v2>=N:
      ov2=1
      v2%=N

  # 操作3
  if ov:
    if dist[0]>d+C:
      dist[0]=d+C
  else:
    if fac_over[v]:
      if dist[fac[v]+N]>d+C:
        dist[fac[v]+N]=d+C
        heapq.heappush(q,(d+C,fac[v]+N))
    else:
      if dist[fac[v]]>d+C:
        dist[fac[v]]=d+C
        heapq.heappush(q,(d+C,fac[v]))

print(min(dist[0],dist[N]))