#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
#define yn {puts("YES");}else{puts("NO");}
#define MAX_N 200005
const ll MOD = 1000000007;
ll mod_pow(ll x, ll n, ll mod){ // x ^ n % mod
    ll res = 1;
    while(n > 0){
        if (n & 1) res = res * x % mod;
        x = x * x % mod;
        n >>= 1;
    }
    return res;
}
int main() {
    ll a, b, c, d, n;
    cin >> a >> b >> c >> d >> n;
    ll ans = 0;
    if(n % 4 == 0){
        ll m = n / 4;
        if(m % 2 == 0){
            ans = (b+d+MOD*100)%MOD*mod_pow(4,m,MOD)%MOD;
        }else{
            ans = MOD - (a+c+MOD*100)%MOD*mod_pow(4,m,MOD)%MOD;
        }
    }else if(n % 4 == 1){
        ll m = (n-1) / 4;
        if(m % 2 == 0){
            ans = (b*2+MOD*100)%MOD*mod_pow(4,m,MOD)%MOD;
        }else{
            ans = MOD - (a*2+MOD*100)%MOD*mod_pow(4,m,MOD)%MOD;
        }
    }else if(n % 4 == 2){
        ll m = (n-2) / 4;
        if(m % 2 == 0){
            ans = (b*2-c*2+MOD*100)%MOD*mod_pow(4,m,MOD)%MOD;
        }else{
            ans = MOD - (a*2-d*2+MOD*100)%MOD*mod_pow(4,m,MOD)%MOD;
        }
    }else if(n % 4 == 3){
        ll m = (n-3) / 4;
        if(m % 2 == 0){
            ans = (-c*4+MOD*100)%MOD*mod_pow(4,m,MOD)%MOD;
        }else{
            ans = MOD - (-d*4+MOD*100)%MOD*mod_pow(4,m,MOD)%MOD;
        }
    }
    cout << ans << endl;
    return 0;
}