#include using namespace std; #define ll long long #define FOR(i,l,r) for(ll i=(l);i<(r);++i) #define REP(i,n) FOR(i,0,n) #define REPS(i,n) FOR(i,1,n+1) #define RFOR(i,l,r) for(ll i=(l);i>=(r);--i) #define RREP(i,n) RFOR(i,n-1,0) #define RREPS(i,n) RFOR(i,n,1) #define pb push_back #define eb emplace_back #define SZ(x) ((ll)(x).size()) #define all(x) (x).begin(),(x).end() #define rall(x) (x).rbegin(),(x).rend() template using V = vector; template using VV = V>; template inline bool chmin(T& a, T b) {if (a > b) {a = b; return true; }return false; } template inline bool chmax(T& a, T b) {if (a < b) {a = b; return true; }return false; } inline void Yes(bool b = true) {cout << (b ? "Yes" : "No") << '\n';} inline void YES(bool b = true) {cout << (b ? "YES" : "NO") << '\n';} inline void err(bool b = true) {if(b) {cout << -1 << '\n'; exit(0);}} template inline void fin(bool b = true, T e = 0) {if(b) {cout << e << '\n'; exit(0);}} template T Roundup_div(T x, T y) {return (x+(y-1))/y;} const ll INF = 1e18; //Modulo Calculation const int MOD = 1e9 + 7; // const int MOD = 998244353; //ModInt template T pow(T a, long long n, T e = 1) { T ret = e; while (n) { if (n & 1) ret *= a; a *= a; n >>= 1; } return ret; } template struct ModInt { int x; ModInt() : x(0) {} ModInt(ll x_) { if ((x = x_ % mod + mod) >= mod) x -= mod; } ModInt& operator+=(ModInt rhs) { if ((x += rhs.x) >= mod) x -= mod; return *this; } ModInt& operator-=(ModInt rhs) { if ((x -= rhs.x) < 0) x += mod; return *this; } ModInt& operator*=(ModInt rhs) { x = (unsigned long long)x * rhs.x % mod; return *this; } ModInt& operator/=(ModInt rhs) { x = (unsigned long long)x * rhs.inv().x % mod; return *this; } ModInt operator-() const { return -x < 0 ? mod - x : -x; } ModInt operator+(ModInt rhs) const { return ModInt(*this) += rhs; } ModInt operator-(ModInt rhs) const { return ModInt(*this) -= rhs; } ModInt operator*(ModInt rhs) const { return ModInt(*this) *= rhs; } ModInt operator/(ModInt rhs) const { return ModInt(*this) /= rhs; } bool operator==(ModInt rhs) const { return x == rhs.x; } bool operator!=(ModInt rhs) const { return x != rhs.x; } ModInt inv() const { return pow(*this, mod - 2); } friend ostream& operator<<(ostream& s, ModInt a) { s << a.x; return s; } friend istream& operator>>(istream& s, ModInt& a) { s >> a.x; return s; } }; using mint = ModInt; int main(){ ios::sync_with_stdio(false); cin.tie(nullptr); ll n; mint a, b, c; cin >> n >> a >> b >> c; n--; ll t = n / 6; a *= pow((mint)-27, t); b *= pow((mint)-27, t); c *= pow((mint)-27, t); REP(i, n % 6){ mint x = a, y = b, z = c; a = x - y; b = y - z; c = z - x; } cout << a << " " << b << " " << c << endl; }