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

#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define FORR2(x,y,arr) for(auto& [x,y]:arr)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
template<class T> bool chmax(T &a, const T &b) { if(a<b){a=b;return 1;}return 0;}
template<class T> bool chmin(T &a, const T &b) { if(a>b){a=b;return 1;}return 0;}
//-------------------------------------------------------

int N,A,B,C;
ll dp[202020][2];

void solve() {
	int i,j,k,l,r,x,y; string s;
	
	cin>>N>>A>>B>>C;
	FOR(i,N) dp[i][0]=dp[i][1]=1LL<<60;
	priority_queue<pair<ll,int>> Q;
	dp[1][1]=A+B;
	Q.push({-dp[1][1],3});
	while(Q.size()) {
		ll co=-Q.top().first;
		int cur=Q.top().second/2;
		int one=Q.top().second%2;
		Q.pop();
		if(dp[cur][one]!=co) continue;
		
		// add 1
		if(chmin(dp[(cur+1)%N][1],co+A+(one?0:B))) {
			Q.push({-dp[(cur+1)%N][1],((cur+1)%N)*2+1});
		}
		// mult 2
		if(chmin(dp[(cur*2)%N][0],co+C)) {
			Q.push({-dp[(cur*2)%N][0],((cur*2)%N)*2+0});
		}
	}
	FOR(i,N) cout<<min(dp[i][0],dp[i][1])<<endl;
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	cout.tie(0); solve(); return 0;
}