import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


enum INF = 10L^^18;

void main() {
  try {
    for (; ; ) {
      const N = readInt;
      const A = readLong;
      const B = readLong;
      const C = readLong;
      
      alias Entry = Tuple!(long, "d", int, "u", int, "s");
      BinaryHeap!(Array!Entry, "a.d > b.d") que;
      auto dist = new long[2][N];
      foreach (u; 0 .. N) {
        dist[u][0] = dist[u][1] = INF;
      }
      que.insert(Entry(dist[1][1] = A + B, 1, 1));
      for (; !que.empty; ) {
        const d = que.front.d;
        const u = que.front.u;
        const s = que.front.s;
        que.removeFront;
        if (d == dist[u][s]) {
          void update(long dd, int v, int ss) {
            if (chmin(dist[v][ss], dd)) {
              que.insert(Entry(dd, v, ss));
            }
          }
          if (s) {
            int v = u + 1;
            if (v >= N) v -= N;
            update(d + A, v, 1);
          }
          update(d + B, u, 1);
          {
            int v = u << 1;
            if (v >= N) v -= N;
            update(d + C, v, 0);
          }
        }
      }
      
      foreach (u; 0 .. N) {
        const ans = min(dist[u][0], dist[u][1]);
        writeln(ans);
      }
      debug {
        writeln("========");
      }
    }
  } catch (EOFException e) {
  }
}