#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> P;
typedef vector<ll> VI;
typedef vector<VI> VVI;
const ll MOD = 1000000007;
const ll INF = 1e18;
#define REP(i, n) for (int i = 0; i < n; i++)
#define ALL(v) v.begin(), v.end()

ll power(ll x, ll y) {
	if (y==0) return 1;
	else if (y==1) return x%MOD;
	else if (y%2==0) { ll pow=power(x,y/2); return (pow*pow)%MOD; } 
	else { ll pow=power(x,y/2); return ((pow*pow)%MOD)*x%MOD; }
}

int main(){
	ll n; cin >> n; n-=2;
	ll a, b, c; cin >> a >> b >> c;
	ll p=n%12;
	ll pw=power(3,(n/12)*6);
	VVI ans(3,VI(3,0));
	REP(i,3) ans[i][i]=pw;
	REP(i,3) ans[i][(i+1)%3]=-pw+MOD;
	REP(i,p){
		VVI na(3,VI(3,0));
		REP(j,3){
			REP(k,3){
				na[j][k]+=ans[j][k];
				na[j][k]-=ans[(j+1)%3][k];
				na[j][k]=(na[j][k]+5*MOD)%MOD;
			}
		}
		REP(j,3)REP(k,3)
			ans[j][k]=na[j][k];
	}
	REP(i,3){
		ll sum=0;
		sum+=a*ans[i][0];
		sum+=b*ans[i][1];
		sum+=c*ans[i][2];
		sum%=MOD;
		cout << sum << ' ';
	}
	cout << endl;
	return 0;
}