from heapq import*

n,a,b,c=map(int,input().split())
inf=1<<61
dist=[[inf]*2 for i in range(n)]
seen=[[0]*2 for i in range(n)]
hq=[(0,0,0)]

while hq:
  d,i,f=heappop(hq)
  if dist[i][f]<d:
    continue
  if i!=0 or f!=0:
    seen[i][f]=1
  if seen[(i+1)%n][1]==False and d+a+(1-f)*b<dist[(i+1)%n][1]:
    dist[(i+1)%n][1]=d+a+(1-f)*b
    heappush(hq,(d+a+(1-f)*b,(i+1)%n,1))
  if seen[(2*i)%n][0]==False and d+c<dist[(2*i)%n][0] and i!=0:
    dist[(2*i)%n][0]=d+c
    heappush(hq,(d+c,(2*i)%n,0))

for i in dist:
  print(min(i))