#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cmath>
#define int long long
using namespace std;
const int Mx=100010;
const int p=10086;
int n,m,x,q,rank,now,a[Mx];
void gauss()
{  
    now=1,m=31;
    while(m--)
        for(int i=now;i<=n;i++)
            if(a[i]&(1<<m))
            {
                swap(a[i],a[now]);
                for(int j=1;j<=n;j++)
                    if(j!=now&&(a[j]&(1<<m))) a[j]^=a[now];
                now++; break;
            }
    now--;
}
signed main()  
{  
    scanf("%lld",&n);  
    for(int i=1;i<=n;i++) scanf("%lld",&a[i]);  
    scanf("%lld",&q);  
    gauss();
    for(int i=1;i<=now;i++)
    {  
        if((x^a[i])>q) continue;
        x^=a[i];
        rank=(rank+(1<<(now-i)))%p;
    }  
    for(int i=1;i<=n-now;i++) rank=(rank<<1)%p;
    printf("%lld\n",(rank+1)%p);
    return 0;
}