#include <iostream>
#include <vector>
#include <fstream>
using namespace std;
int lowerBound(vector<int> a, int k, int n)
{
	int l = -1, r = n, m;
	while (l < r - 1)
	{
		m = (l + r) / 2;
		if (a[m] < k)
			l = m;
		else
			r = m;
	}
	if (r < n && a[r] == k)
		return r + 1;
	else return -1;
}
int upperBound(vector<int> a, int k, int n)
{
	int l = -1, r = n, m;
	while (l < r - 1)
	{
		m = (l + r) / 2;
		if (a[m] <= k)
			l = m;
		else
			r = m;
	}
	if (l < n && a[l] == k)
		return l + 1;
	else return -1;
}
int main()
{
	ifstream in("binsearch.in");
	ofstream out("binsearch.out");
	ios::sync_with_stdio(false);
	int n, m, k, l, r;
	cin >> n;
	vector<int> a(n);
	for (int i = 0; i < n; i++)
		cin >> a[i];
	cin >> m;
	for (int i = 0; i < m; i++)
	{
		cin >> k;
		l = lowerBound(a, k, n);
		r = upperBound(a, k, n);
		cout << l << " " << r << "\n";
	}

	//cin >> l;
	return 0;
}