#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vin=vector<int>;
using vll=vector<long long>;
using vvin=vector<vector<int>>;
using vvll=vector<vector<long long>>;
using vstr=vector<string>;
using vvstr=vector<vector<string>>;
using vch=vector<char>;
using vvch=vector<vector<char>>;
using vbo=vector<bool>;
using vvbo=vector<vector<bool>>;
using vpii=vector<pair<int,int>>;
using pqsin=priority_queue<int,vector<int>,greater<int>>;
#define mp make_pair
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define rep2(i,s,n) for(int i=(s);i<(int)(n);i++)
#define all(v) v.begin(),v.end()
#define decp(n) cout<<fixed<<setprecision((int)n)
const ll inf=1e9+7;
const ll INF=1e18;

ll modpow(ll a,ll n,ll m){
    ll res=1;
    while(n){
        if(n&1)res=(res*a)%m;
        a=(a*a)%m;
        n>>=1;
    }
    return res;
}

int main(){
    ll n;cin>>n;
    ll a,b,c;cin>>a>>b>>c;
    ll x,y,z;
    ll k=n/2;
    if(n%2==0){
        ll tmp=modpow((ll)3,k-1,inf);
        if(k%2==0)tmp*=-1;
        if(n%6==0){
            x=(tmp*(c-a))%inf;
            y=(tmp*(a-b))%inf;
            z=(tmp*(b-c))%inf;
        }
        else if(n%6==2){
            x=(tmp*(a-b))%inf;
            y=(tmp*(b-c))%inf;
            z=(tmp*(c-a))%inf;
        }
        else{
            x=(tmp*(b-c))%inf;
            y=(tmp*(c-a))%inf;
            z=(tmp*(a-b))%inf;
        }
    }
    else{
        ll tmp=modpow((ll)3,k,inf);
        if(k%2)tmp*=-1;
        if(n%6==1){
            x=(tmp*a)%inf;
            y=(tmp*b)%inf;
            z=(tmp*c)%inf;
        }
        else if(n%6==3){
            x=(tmp*b)%inf;
            y=(tmp*c)%inf;
            z=(tmp*a)%inf;
        }
        else{
            x=(tmp*c)%inf;
            y=(tmp*a)%inf;
            z=(tmp*b)%inf;
        }
    }
    if(x<0)x+=inf;
    if(y<0)y+=inf;
    if(z<0)z+=inf;
    cout<<x<<" "<<y<<" "<<z<<endl;
}