n,a,b,c = map(int,input().split())
dp = [10 ** 18] * 2 * n
dp[1] = 0
ikeru = [[] for i in range(2 * n)]
costb = [b ** k for k in range(55)]
kaijo = 1
for i in range(1, 2 * n):
	kaijo *= i
	if kaijo >= n: kaijo = kaijo % n + n
	ikeru[i].append((kaijo, c))
	
	tar = i * i
	if tar >= n: tar = tar % n + n
	for k in range(2, 50):
		if costb[k] >= 10 ** 11: break
		ikeru[i].append((tar, costb[k]))
		tar *= i
		if tar >= n: tar = tar % n + n
	
	tar = i + 1
	if tar >= n: tar = tar % n + n
	ikeru[i].append((tar, a))

import heapq
pq = []
heapq.heappush(pq, (0, 1))
while pq:
	tmp, i = heapq.heappop(pq)
	if tmp > dp[i]: continue
	for j, cost in ikeru[i]:
		if cost + tmp < dp[j]:
			dp[j] = cost + tmp
			heapq.heappush(pq, (dp[j], j))
	
print(dp[n])