#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;

ll mod = 1e9+7;
ll modpow(ll a,ll b){
    ll ans = 1;
    a %= mod;
    while(b){
        if(b&1) ans = ans * a % mod;
        a = a * a % mod;
        b >>= 1;
    }
    return ans;
}

int main(){
    cin.tie(0);
    ios::sync_with_stdio(0);
    
    ll A,B,C,D,N; cin >> A >> B >> C >> D >> N;
    auto f = [N](ll a, ll b) {
        rep(_,N%8) tie(a, b) = make_pair(a - b, a + b);
        return a + b;
    };

    ll ans = max({f(A, C), f(A, D), f(B, C), f(B, D)});
    ans = (ans % mod + mod) % mod;
    ans *= modpow(16, N / 8);
    ans %= mod;
    cout << ans << endl;
}