#include <bits/stdc++.h>
#define int long long
using namespace std;
const int N = 3e5 + 10;
unordered_map<int, int> mp;
vector<int> s[N];
int cnt;
signed main()
{
int n;
while (cin >> n)
{
mp.clear();
for (int i = 1; i <= n; i ++ ) s[i].clear();
for (int i = 1; i <= n; i ++ )
{
int x;
cin >> x;
if (mp[x] == 0) mp[x] = ++ cnt;
s[mp[x]].push_back(i);
}
int q;
cin >> q;
for (int i = 1; i <= q; i ++ )
{
int l, r, k;
cin >> l >> r >> k;
k = mp[k];
int ll = lower_bound(s[k].begin(), s[k].end(), l) - s[k].begin();
int rr = upper_bound(s[k].begin(), s[k].end(), r) - s[k].begin();
cout << rr - ll << endl;
}
}
return 0;
}