#include <stdio.h>
#include <stdlib.h>

int cmp_int (const void *ap, const void *bp) {
  int a = *(int *)ap;
  int b = *(int *)bp;
  
  if (a < b) {
    return -1;
  }
  
  if (a > b) {
    return 1;
  }
  
  return 0;
}

int main () {
  int n = 0;
  int h[200000][2] = {};
  int t[200000] = {};
  int q = 0;
  int a = 0;
  int b = 0;
  
  int res = 0;
  
  int max[18][200000] = {};
  int org_h[200000] = {};
  int max_idx[18][200000] = {};
  
  res = scanf("%d", &n);
  for (int i = 0; i < n; i++) {
    res = scanf("%d", h[i]);
    h[i][1] = i;
    org_h[i] = h[i][0];
  }
  for (int i = 0; i < n; i++) {
    res = scanf("%d", t+i);
  }
  
  qsort(h, n, sizeof(int)*2, cmp_int);
  
  max[0][0] = t[h[0][1]];
  for (int j = 1; j < n; j++) {
    max[0][j] = t[h[j][1]];
    if (max[0][j] < max[0][j-1]) {
      max[0][j] = max[0][j-1];
    }
  }
  
  for (int i = 1; i < 18; i++) {
    for (int j = 0; j < n; j++) {
      int idx[2] = { -1, n };
      while (idx[1]-idx[0] > 1) {
        int nxt = (idx[0]+idx[1])/2;
        if (h[nxt][0] <= max[i-1][j]) {
          idx[0] = nxt;
        } else {
          idx[1] = nxt;
        }
      }
      if (idx[0] < 0) {
        max[i][j] = max[i-1][j];
      } else {
        max[i][j] = max[i-1][idx[0]];
      }
      if (max[i][j] < max[i-1][j]) {
        max[i][j] = max[i-1][j];
      }
      if (j > 0 && max[i][j] < max[i][j-1]) {
        max[i][j] = max[i][j-1];
      }
    }
  }
  
  for (int i = 0; i < 18; i++) {
    int idx = -1;
    for (int j = 0; j < n; j++) {
      while (idx < n-1 && h[idx+1][0] <= max[i][j]) {
        idx++;
      }
      max_idx[i][j] = idx;
    }
  }
  
  res = scanf("%d", &q);
  while (q > 0) {
    res = scanf("%d", &a);
    res = scanf("%d", &b);
    a--;
    b--;
    if (t[a] >= org_h[b]) {
      printf("1\n");
    } else {
      int idx = -1;
      int r = n;
      int ans[2] = { 0, (1<<18) };
      int bit = 17;
      while (r-idx > 1) {
        int nidx = (idx+r)/2;
        if (h[nidx][0] <= t[a]) {
          idx = nidx;
        } else {
          r = nidx;
        }
      }
      while (ans[1]-ans[0] > 1) {
        int nxt = (ans[0]+ans[1])/2;
        if (idx >= 0 && org_h[b] <= max[bit][idx]) {
          ans[1] = nxt;
        } else {
          ans[0] = nxt;
          if (idx >= 0) {
            idx = max_idx[bit][idx];
          }
        }
        bit--;
      }
      if (ans[1] < n) {
        printf("%d\n", ans[1]+1);
      } else {
        printf("-1\n");
      }
    }
    q--;
  }
  
  return 0;
}