#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, m, n) for (ll i = m; i < n; i++)
#define rrep(i, m, n) for (ll i = m - 1; i >= n; i--)
#define pb(n) push_back(n)
#define UE(N) N.erase(unique(N.begin(), N.end()), N.end());
#define Sort(n) sort(n.begin(), n.end())
#define Rev(n) reverse(n.begin(), n.end())
#define HOUT(S) cout << setprecision(50) << S << endl
#define pint pair<ll, ll>
#define paf(L, R) pair<L, R>
#define mod 1000000007
#define MAX 10000010
#define endl "\n"
#define ALL(a) a.begin(), a.end()
#define chmax(a, b) a = (((a) < (b)) ? (b) : (a))
#define chmin(a, b) a = (((a) > (b)) ? (b) : (a))

template <typename T> vector<T> make_v(size_t a) { return vector<T>(a); }

template <typename T, typename... Ts> auto make_v(size_t a, Ts... ts) {
    return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));
}

template <typename T, typename U, typename... V>
typename enable_if<is_same<T, U>::value != 0>::type fill_v(U& u, const V... v) {
    u = U(v...);
}

template <typename T, typename U, typename... V>
typename enable_if<is_same<T, U>::value == 0>::type fill_v(U& u, const V... v) {
    for (auto& e : u) fill_v<T>(e, v...);
}

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


int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    ll A, B, C, D, N;
    cin >> A >> B >> C >> D >> N;
    ll x = N / 4, y = N % 4;
    ll ans = modpow(-4, x, mod);
    if(x & 1) {
        if(y == 0) ans = ans * ((A + C + 2LL * mod) % mod) % mod;
        else if(y == 1) ans = ans * (2 * (A + 2LL * mod) % mod) % mod;
        else if(y == 2) ans = ans * (2 * (A - D + 2LL * mod) % mod) % mod;
        else ans = ans * (mod - 4) % mod * ((B + 2LL * mod) % mod) % mod;  
    }
    else {
        if(y == 0) ans = ans * ((B + D + 2LL * mod) % mod) % mod;
        else if(y == 1) ans = ans * (2 * (B + 2LL * mod) % mod) % mod;
        else if(y == 2) ans = ans * (2 * (B - C + 2LL * mod) % mod) % mod;
        else ans = ans * (mod - 4) % mod * ((A + 2LL * mod) % mod) % mod;  
    }
    cout << ans << endl;
}