#include <bits/stdc++.h>
# define endl            '\n'
# define clr(x,a)        memset(x,a,sizeof(x))
# define vi              vector<int>
# define all(a)          a.begin(), a.end()
# define deb(x)          cout<<#x<<"=="<<x<<endl;
# define pb              push_back
# define sc              scanf
# define pr              printf
# define tc              int t; cin>>t; while(t--)
# define rev(s)          reverse(s.begin(),s.end())
# define linija          cout<<"___________\n";
# define sza(x)          (int)x.size()
using namespace std;
typedef long long ll;
const int mxN=100005, mxM=100005, LOG=18, koren=317, inf=1e8;
const ll mod=4294967295;
template<typename T> T nzd(T a, T b){if(b==0) return a;else return nzd(b, a%b);}
template<typename T> T nzs(T a, T b){return(a*(b/nzd(a,b)));}
template<typename T> T stepenuj(T e, T n){T x=1,p=e;while(n){if(n&1)x=(x*p)&mod;p=(p*p)&mod;n>>=1;}return x;}
template<typename T> inline T na2(T x){return x*x;}
ll a, b, c, d, n, sol, prekal1024[2130], prekal1e6[5000006], x;

void fuja(ll x){
   ll t=1;
   for(int i=0; i<=31; i++){
      if ((t<<i)&x) cout<<1;
      else cout<<0;
   }
   cout<<endl;
}
void kalkulisi(){
   prekal1024[0]=1;
   for(int i=1; i<2048; i++)
      prekal1024[i]=(prekal1024[i-1]*a)&mod;
   prekal1e6[1]=stepenuj(a, (ll)2048);
   for(ll i=4096, br=2; i<=mod; br++,i+=2048){
      prekal1e6[br]=(prekal1e6[1]*prekal1e6[br-1])&mod;
   }
   prekal1e6[0]=1;
}
ll calc(){
   int ost1=b&2047, ost2=(b-ost1)>>11;
   return (prekal1024[ost1]*prekal1e6[ost2])&mod;
}
int main(){
   freopen("power.in", "r", stdin);
   freopen("power.out", "w", stdout);
   cin>>a>>b>>c>>d>>n;
   kalkulisi();
//   return 0;
   for(int i=1; i<=n; i++){
      b=(b*c+d)&mod;
      x=calc();
      sol=(sol^x);
   }

   cout<<sol<<endl;

	return 0;
}