#include <iostream>
using namespace std;

const int MAX_SIZE = 1000000;

int main() {
    int n, arr[MAX_SIZE + 1];
    cin >> n;
    for (int i = 1; i <= n; ++i) {
        cin >> arr[i];
    }
    int m;
    cin >> m;
    int x;
    int positions[m];
    for (int j = 0; j < m; ++j) { 
        cin >> x;
        int left = 1, right = n, lastPosition = -1;
        while (left <= right) {
            int mid = left + (right - left) / 2;
            if (arr[mid] == x) {
                lastPosition = mid; 
                left = mid + 1; 
            } else if (arr[mid] < x) {
                left = mid + 1;
            } else {
                right = mid - 1;
            }
        }
        positions[j] = lastPosition;  
    }
    for (int j = 0; j < m; ++j) {
        cout << positions[j] << " ";
    }
    return 0;
}