#include "bits/stdc++.h"
#include "atcoder/all"
using namespace std;
using namespace atcoder;
using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
long long f(long long X, long long Y, int n) {
	rep(i, n) {
		long long tmpX = X - Y;
		long long tmpY = X + Y;
		X = tmpX;
		Y = tmpY;
	}
	return X + Y;
}
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	long long A, B, C, D, N;
	cin >> A >> B >> C >> D >> N;
	long long Ncopy = N / 8;
	mint ans = 1;
	mint now = 16;
	while (Ncopy > 0) {
		if (1 == Ncopy % 2) {
			ans *= now;
		}
		Ncopy /= 2;
		now *= now;
	}
	ans *= max(max(f(A, C, N % 8), f(A, D, N % 8)), max(f(B, C, N % 8), f(B, D, N % 8)));
	cout << ans.val() << endl;
	return 0;
}