#include <cstdio>
#include <iostream>
#include <algorithm>
#include <ctime>
#include <cstdlib>
#include <algorithm>
using namespace std;
int n, m, a[1000010];
int main()
{
    scanf("%d", &n);
    for(int i = 0 ; i < n ; i++ ) scanf("%d", a+i);
    scanf("%d", &m);
    while( m-- )
    {
        int t;
        scanf("%d", &t);
        int lb = 0, ub = n-1, t;
        scanf("%d", &t);
        while( lb < ub )
        {
            int m = (lb+ub-1)/2;
            if( a[m] >= t ) ub = m;
            else lb = m+1;
        }
        printf("%d\n", a[ub]==t?ub+1:-1);

      //  if( *lower_bound(a,a+n) == t )
      //      printf("%d\n", (int)(lower_bound(a,a+n)-a));
      //  else printf("-1\n");
    }
}