#include<bits/stdc++.h>
using namespace std;
using ll=long long;
constexpr ll mod=1000000007;
ll mod_pow(ll a,ll b){
  if(!b)return 1;
  if(b&1)return mod_pow(a,b-1)*a%mod;
  ll c=mod_pow(a,b>>1);
  return c*c%mod;
}
int main(){
  ll A,B,C,D,N; cin>>A>>B>>C>>D>>N;
  ll ans;
  if(N%8==0)ans=B+D;
  else if(N%8==1)ans=2*B;
  else if(N%8==2)ans=2*B-2*C;
  else if(N%8==3)ans=-4*C;
  else if(N%8==4)ans=-4*A-4*C;
  else if(N%8==5)ans=-8*A;
  else if(N%8==6)ans=-8*A+8*D;
  else if(N%8==7)ans=16*D;
  cout<<(ans%mod*mod_pow(16,N/8)%mod+mod)%mod<<endl;
}