#include <iostream>
#include <algorithm>
#include <vector>

using namespace std;

int main()
{
    int numbersCount, studentsCount, student;
    vector<int>numbers;
    cin >> numbersCount;
    numbers.resize(numbersCount);
    while(numbersCount--)
        cin >> numbers[numbersCount];
    
    sort(numbers.begin(),numbers.end());
    
    cin >> studentsCount;
    while(studentsCount--)
    {
        cin >> student;
        int dist = distance(numbers.begin(),lower_bound(numbers.begin(),numbers.end(),student));
        cout << (dist == numbers.size() || dist == 0 ? numbers.size()-dist : numbers.size()-dist-1)  << ' '
             << dist << endl;
    }
    return 0;
}