#include <iostream>
#include <fstream>
#include <memory.h>
using namespace std;
ifstream f ("xp.in");
ofstream g ("xp.out");
long long max(long long x, long long y)
{
    if (x>y) return x;
    else return y;
}
int x,rez,val;
int q,i,j,prod[250000],n,p,a1,b1,a,b;
int main()
{
    f>>n>>a1>>b1>>p>>q;
    i=1;
    x=max(1,((i%p)^(((a1+1)&(b1+1))%p))%p);
    prod[1]=1;
    for (i=2;i<=n;i++)
        prod[i]=x;
    for (i=2;i<=n;i++)
    {
        a=((a1+p-1)^(b1+1))%p;
        b=((a1+p-1)|(b1+1))%p;
        val=max(1LL,((i%p)^(((a+1)&(b+1))%p))%p);
        for (j=1;j<i;j++)
        {
            prod[j]=(prod[j]*val)%q;
        }
        for (j=i+1;j<=n;j++)
        {
            prod[j]=(prod[j]*val)%q;
        }
        a1=a;
        b1=b;
    }
    rez=prod[1];
    for (i=2;i<=n;i++)
    {
        rez=(rez^prod[i]);
    }
    g<<rez;
    return 0;
}