#pragma GCC optimize ("O2")
#pragma GCC target ("avx2")
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
#define ce(x) cerr << (x) << "\n"
#define cesp(x) cerr << (x) << " "
#define pb push_back
#define mp make_pair
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
#define Would
#define you
#define please

const int mod = 1e9 + 7;
constexpr ll modpow(ll A, ll B) {
	ll kotae = 1;
	while (B > 0) {
		if (B & 1) kotae = kotae * A % mod;
		A = A * A % mod;
		B >>= 1;
	}
	return kotae;
}

int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);


	ll N, A, B, C;
	cin >> N >> A >> B >> C;

	N -= 2;

	ll bairitu = modpow(3, N / 2);

	if (N % 12 / 4 == 1) {
		ll tmp = A;
		A = C;
		C = B;
		B = tmp;
	}
	if (N % 12 / 4 == 2) {
		ll tmp = A;
		A = B;
		B = C;
		C = tmp;
	}

	if (N % 4 == 0) {
		cosp((A - B + mod) * bairitu % mod);
		cosp((B - C + mod) * bairitu % mod);
		co((C - A + mod) * bairitu % mod);
	}
	if (N % 4 == 1) {
		cosp((A - B * 2 + C + 2 * mod) * bairitu % mod);
		cosp((B - C * 2 + A + 2 * mod) * bairitu % mod);
		co((C - A * 2 + B + 2 * mod) * bairitu % mod);
	}
	if (N % 4 == 2) {
		cosp((C - B + mod) * bairitu % mod);
		cosp((A - C + mod) * bairitu % mod);
		co((B - A + mod) * bairitu % mod);
	}
	if (N % 4 == 3) {
		cosp((-A + C * 2 - B + 2 * mod) * bairitu % mod);
		cosp((-B + A * 2 - C + 2 * mod) * bairitu % mod);
		co((-C + B * 2 - A + 2 * mod) * bairitu % mod);
	}

	Would you please return 0;
}