def matmul(A,B): # A,B: 行列
    res = [[0]*len(B[0]) for _ in [None]*len(A)]
    for i, resi in enumerate(res):
        for k, aik in enumerate(A[i]):
            for j,bkj in enumerate(B[k]):
                resi[j] += aik*bkj
                resi[j] %= MOD
    return res

def matpow(A,p): #A^p mod M
    if p%2:
        return matmul(A, matpow(A,p-1))
    elif p > 0:
        b = matpow(A,p//2)
        return matmul(b,b)
    else:
        return [[int(i==j) for j in range(len(A))] for i in range(len(A))]

MOD=10**9+7
n = int(input())
a,b,c = map(int,input().split())
A = [[1,-1,0],[0,1,-1],[-1,0,1]]
v = matmul(matpow(A,n-1),[[a],[b],[c]])
r = v[0]+v[1]+v[2]
print(*r)