#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
#include <fstream>
#include <utility>
#include <functional>
#include <time.h>
#include <stack>
#include <array>
#include <list>
#include <atcoder/all>
#define popcount __builtin_popcount
using namespace std;
using namespace atcoder;
typedef long long ll;
typedef pair<int, int> P;

int main()
{
    ll a, b, c, d;
    cin>>a>>b>>c>>d;
    ll n;
    cin>>n;
    using mint=modint1000000007;
    mint p=mint(16).pow(n/8);
    if(n%8==0) cout<<(p*mint(b+d)).val()<<endl;
    else if(n%8==1) cout<<(p*mint(2*b)).val()<<endl;
    else if(n%8==2) cout<<(p*mint(2*b-2*c)).val()<<endl;
    else if(n%8==3) cout<<(p*mint(-4*c)).val()<<endl;
    else if(n%8==4) cout<<(p*mint(-4*(a+c))).val()<<endl;
    else if(n%8==5) cout<<(p*mint(-8*a)).val()<<endl;
    else if(n%8==6) cout<<(p*mint(-8*a+8*d)).val()<<endl;
    else cout<<(p*mint(16*d)).val()<<endl;
    return 0;
}