#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 10;
struct node { int bh, bs, cs; } a[N]; int t[N];
bool cmp(node &x, node &y) { return x.bs != y.bs ? x.bs > y.bs : x.cs != y.cs ? x.cs > y.cs : x.bh > y.bh; }
unordered_map<int, int> ys;
int main()
{
    int n, m, x; scanf("%d", &n);
    for (int i = 1; i <= n; ++i) scanf("%d", &x), ++ys[x];
    scanf("%d", &m);
    for (int i = 1; i <= m; ++i) scanf("%d", &x), a[i].bs = ys[x], a[i].bh = i;
    for (int i = 1; i <= m; ++i) scanf("%d", &x), a[i].cs = ys[x];
    sort(a + 1, a + 1 + m, cmp);
    printf("%d\n", a[1].bh);
    return 0;
}