#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;
}
 

I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZSA8YWxnb3JpdGhtPgojaW5jbHVkZSA8dmVjdG9yPgoKdXNpbmcgbmFtZXNwYWNlIHN0ZDsKCmludCBtYWluKCkKewogICAgaW50IG51bWJlcnNDb3VudCwgc3R1ZGVudHNDb3VudCwgc3R1ZGVudDsKICAgIHZlY3RvcjxpbnQ+bnVtYmVyczsKICAgIGNpbiA+PiBudW1iZXJzQ291bnQ7CiAgICBudW1iZXJzLnJlc2l6ZShudW1iZXJzQ291bnQpOwogICAgd2hpbGUobnVtYmVyc0NvdW50LS0pCiAgICAgICAgY2luID4+IG51bWJlcnNbbnVtYmVyc0NvdW50XTsKICAgIAogICAgc29ydChudW1iZXJzLmJlZ2luKCksbnVtYmVycy5lbmQoKSk7CiAgICAKICAgIGNpbiA+PiBzdHVkZW50c0NvdW50OwogICAgd2hpbGUoc3R1ZGVudHNDb3VudC0tKQogICAgewogICAgICAgIGNpbiA+PiBzdHVkZW50OwogICAgICAgIGludCBkaXN0ID0gZGlzdGFuY2UobnVtYmVycy5iZWdpbigpLGxvd2VyX2JvdW5kKG51bWJlcnMuYmVnaW4oKSxudW1iZXJzLmVuZCgpLHN0dWRlbnQpKTsKICAgICAgICBjb3V0IDw8IChkaXN0ID09IG51bWJlcnMuc2l6ZSgpIHx8IGRpc3QgPT0gMCA/IG51bWJlcnMuc2l6ZSgpLWRpc3QgOiBudW1iZXJzLnNpemUoKS1kaXN0LTEpICA8PCAnICcKICAgICAgICAgICAgIDw8IGRpc3QgPDwgZW5kbDsKICAgIH0KICAgIHJldHVybiAwOwp9Cg==

NQoyIDMgNCA1IDYKNAoxCjMKNQo3

5
2 3 4 5 6
4
1
3
5
7