#include<bits/stdc++.h>
#define endl '\n'
using namespace std;
typedef unsigned long long ll;
void read()
{
	freopen("power.in","r",stdin);
    freopen("power.out","w",stdout);
}
ll i,j,p,q,n,m,k,b0,c,d,b[10000006],a;
const ll mod = (1ll<<32);
ll st(ll a,ll n)
{
    ll f =1;
    while(n>0)
    {
        if(n&1)
            f=(a*f)%mod;
        a=(a*a)%mod;
        n/=2;
    }
    return f;
}
void solve()
{
    cin>>a>>b[0]>>c>>d>>n;
    ll  ans=0;
    for(i=1;i<=n;i++)
    {
        b[i]=((b[i-1]*c)%mod+d%mod)%mod;
        //cout<<b[i]<<endl;
        if(b[i]!=b[i-1])
            p = st(a,b[i]);
        else
        {
            if((n-i+1)%2==1)
                ans=(ans^p);
            break;
        }
        ans=(ans^p);
    }
    cout<<ans<<endl;
}
int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cout.tie(NULL);
	read();
	int T=1;
    while(T--)
        solve();
	return 0;
}
/**
3 5 10035340 9 40
*/