#include <iostream>
#include <vector>
using namespace std;
int main(void) {
    int n;
    cin >> n;
    vector<int> heights(n);
    for (int i = 0; i < n; i++) {
        cin >> heights[i];
    }
    int m;
    cin >> m;
    vector<int> queue;
    for (int i = 0; i < m; i++) {
        int num;
        cin >> num;
        queue.push_back(heights[num]);
        int swaps = 0;
        for (int j = 0; j < queue.size(); j++) {
            for (int k = 0; k < queue.size() - 1; k++) {
                if (queue[k] > queue[k + 1]) {
                    swap(queue[k], queue[k + 1]);
                    swaps++;
                }
            }
        }
        cout << swaps << endl;
    }

    return 0;
}