#include <bits/stdc++.h>
using namespace std;

// Pair of (value, index)
typedef pair<int, int> pii;

int main() {
    int n;
    cin >> n;

    vector<int> a(n);
    priority_queue<pii, vector<pii>, greater<pii>> minHeap;

    for (int i = 0; i < n; ++i) {
        cin >> a[i];
        minHeap.push({a[i], i});
    }

    int q;
    cin >> q;

    for (int i = 0; i < q; ++i) {
        int x;
        cin >> x;

        // Get the minimum element
        while (minHeap.top().first != a[minHeap.top().second]) {
            minHeap.pop();
        }

        pii minElement = minHeap.top();
        minHeap.pop();

        // Output the position (1-based index)
        cout << minElement.second + 1 << endl;

        // Replace the minimum element in the array with x
        a[minElement.second] = x;

        // Insert the new value back into the heap
        minHeap.push({x, minElement.second});
    }

    return 0;
}
#include <bits/stdc++.h>
using namespace std;

// Pair of (value, index)
typedef pair<int, int> pii;

int main() {
    int n;
    cin >> n;

    vector<int> a(n);
    priority_queue<pii, vector<pii>, greater<pii>> minHeap;

    for (int i = 0; i < n; ++i) {
        cin >> a[i];
        minHeap.push({a[i], i});
    }

    int q;
    cin >> q;

    for (int i = 0; i < q; ++i) {
        int x;
        cin >> x;

        // Get the minimum element
        while (minHeap.top().first != a[minHeap.top().second]) {
            minHeap.pop();
        }

        pii minElement = minHeap.top();
        minHeap.pop();

        // Output the position (1-based index)
        cout << minElement.second + 1 << endl;

        // Replace the minimum element in the array with x
        a[minElement.second] = x;

        // Insert the new value back into the heap
        minHeap.push({x, minElement.second});
    }

    return 0;
}