#include<bits/stdc++.h>
using namespace std;
int binary_searc(int x,int n,long long int v[])
{
int left,right,mid;
left=0;
right=n-1;
    while(left<=right)
    {
mid=(left+right)/2;
if(v[mid]<=x&&v[mid+1]>=x)return mid;
if(v[mid]<x&&v[mid+1]<x){left=mid+1;}
else if(v[mid]>x&&v[mid+1]>x){
        right=mid-1;
}
    }


}
int main()
{
int n,q,m;
cin>>n;
long long int a[50001];
for(int i=0;i<n;i++)
{
    cin>>a[i];

}
     cin>>q;
     for(int j=0;j<q;j++)
     {
         cin>>m;
         int r;
         if(n==1){if(m==a[0])cout<<"0"<<' '<<"X"<<endl;}
         else if(m==a[0])cout<<"X"<<' '<<a[0+1]<<endl;
         else if(m==a[n-1])cout<<a[n-2]<<' '<<"X"<<endl;
         else if(m<a[0])cout<<"X"<<' '<<a[0]<<endl;
         else if(m>a[n-1])cout<<a[n-1]<<' '<<"X"<<endl;
         else
         {
             r=binary_searc(m,n,a);
             if(a[r]==m)
             {cout<<a[r-1]<<' '<<a[r+1]<<endl;}
             else
             cout<<a[r]<<' '<<a[r+1]<<endl;}


     }
}