#include <bits/stdc++.h>
using namespace std;
using ll=int;
using pll=pair<ll, ll>;

int main() {
    ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
    ll n; cin >> n;
    map<ll, vector<ll>> mp;
    for (ll i=0; i<n; i++){
        ll x; cin >> x;
        mp[x].push_back(i);
    }
    ll q; cin >> q;
    map<pll, ll> answer;
    for (ll i=0; i<q; i++){
        ll x, y; cin >> y >> x;
        if (answer.find({x, y})!=answer.end()){
            cout << answer[{x, y}] << "\n";
            continue;
        }
        if (mp.find(x)==mp.end() || mp.find(y)==mp.end()){
            cout << "0\n";
            continue;
        }
        ll out=0;
        ll r=mp[x].size()-1, l=0;
        while (r>=0 && l<=mp[y].size()-1 && mp[x][r]>mp[y][l]){
            r--; l++; out++;
        }
        answer[{x, y}]=out;
        cout << out << '\n';
    }
}