Playboy chimp

#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <map>

using namespace std;
typedef long long ll;

int main()
{
    int ch,query;
    map <int, int> mp;
    cin >> ch;
    ll girl, boy;
    vector <ll> chimp;
    for(int i=0;i<ch;i++)
    {
        cin >> girl;
        if(mp.find(girl)!=mp.end())
            continue;
        else
        {
            chimp.push_back(girl);
            mp[girl]=1;
        }
    }
    cin >> query;
    ll luchu[query];
    for(int i=0;i<query;i++)
        cin >> luchu[i];

    for(int i=0;i<query;i++)
    {
        int left,right;
        if(luchu[i]<chimp[0])
        {
            cout << "X " << chimp[0] << endl;
            continue;
        }
        else if(luchu[i]==chimp[0])
        {
            cout << "X " << chimp[1] << endl;
            continue;
        }
        else if(luchu[i]>chimp[chimp.size()-1])
        {
            cout << chimp[chimp.size()-1]  << " X" << endl;
            continue;
        }
        else if(luchu[i]==chimp[chimp.size()-1])
        {
            cout << chimp[chimp.size()-2]  << " X" << endl;
            continue;
        }
        else
        {
            for(int j=0;j<chimp.size();j++)
            {
                if(chimp[j]<luchu[i])
                    continue;
                else
                {
                    if(chimp[j]==luchu[i])
                    {
                        if(j+1 <= chimp.size()-1)
                            cout << chimp[j-1] << " " << chimp[j+1] << endl;
                        else
                            cout << chimp[j-1] << " X" << endl;
                        break;
                    }
                    else if(chimp[j]>luchu[i])
                    {
                        cout << chimp[j-1] << " " << chimp[j] << endl;
                        break;
                    }
                }
            }
        }
    }
    return 0;
}