#include <stdio.h>
#include <stdlib.h>
#include <string.h>
int a[10000005], b[10000005], nex[10000005];
void pre(int a[], int n)
{
int i, j;
i = 0;
j = nex[0] = -1;
while(i < n)
{
while(j != -1 && a[j] != a[i])j = nex[j];
nex[++i] = ++j;
}
return ;
}
int kmp(int a[], int n, int b[], int m)
{
int i, j, ans = -1;
i = j = 0;
pre(b, m);
while(i < n)
{
while(j != -1 && a[i] != b[j])j = nex[j];
i++; j++;
if(j >= m)
{
if(ans != -1)return -1;
else ans = i - m + 1;
j = nex[j];
}
}
return ans;
}
int main()
{
int n, m, i, ans;
scanf("%d", &n);
for(i = 0; i < n; i++)scanf("%d", &a[i]);
scanf("%d", &m);
for(i = 0; i < m; i++)scanf("%d", &b[i]);
pre(b, m);
ans = kmp(a, n, b, m);
if(ans == -1)printf("%d\n", ans);
else printf("%d %d\n", ans, ans + m - 1);
return 0;
}