#include <bits/stdc++.h>
using namespace std;

int main() {
int n;
cin>>n;
 int a[n];
for(int i=0;i<n;i++) {cin>>a[i]; }
int k;cin>>k;
unordered_map<int,int> mp1,mp2;
mp1[0]=-1,mp2[0]=-1;
int ans1=0,ans2=INT_MAX;
int x=0;
for(int j=0;j<n;j++){
    x^=a[j];
    if(mp1.find(x^k)!=mp1.end()){
        int i=mp1[x^k]+1;
        ans2=min(ans2,j-i+1);
    }
    mp1[x]=j;
     if(mp2.find(x^k)!=mp2.end()){
        int i=mp2[x^k]+1;
        ans1=max(ans1,j-i+1);
    }
     if(mp2.find(x^k)==mp2.end()){
        mp2[x]=j;
    }
    

}
cout<<ans1<<" "<<ans2;
}