#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
#include <fstream>
#include <utility>
#include <functional>
#include <time.h>
#include <stack>
#include <array>
#include <list>
#define popcount __builtin_popcount
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
const ll MOD=1e9+7;
ll powmod(ll a, ll k){
    ll ap=a, ans=1;
    while(k){
        if(k&1){
            ans*=ap;
            ans%=MOD;
        }
        ap=ap*ap;
        ap%=MOD;
        k>>=1;
    }
    return ans;
}
ll inv(ll a){
    return powmod(a, MOD-2);
}
int main()
{
	ll n; cin>>n;
	ll a[3];cin>>a[0]>>a[1]>>a[2];
	n-=2;
	ll p=powmod(MOD-27, n/6);
	for(int i=0; i<3; i++) (a[i]*=p)%=MOD;
	int c[6][3]={{1, -1, 0}, {1, -2, 1}, {0, -3, 3}, {-3, -3, 6}, {-9, 0, 9}, {-18, 9, 9}};
	for(int i=0; i<3; i++){
		ll ans=c[n%6][0]*a[i]+c[n%6][1]*a[(i+1)%3]+c[n%6][2]*a[(i+2)%3];
		ans=(ans%MOD+MOD)%MOD;
		cout<<ans<<" ";
	}
	cout<<endl;
	return 0;
}