#pragma comment(linker, "/STACK:1024000000,1024000000")

#include<cstdio>

#include<cstring>

#include<cmath>

#include<algorithm>

#include<vector>

#include<map>

#include<set>

#include<queue>

#include<stack>

#include<iostream>

using namespace std;

typedef long long LL;

const double pi=acos(-1.0),eps=1e-;

void File()

{

    freopen("D:\\in.txt","r",stdin);

    freopen("D:\\out.txt","w",stdout);

}

template <class T>

inline void read(T &x)

{

    char c=getchar(); x=;

    while(!isdigit(c)) c=getchar();

    while(isdigit(c)) {x=x*+c-''; c=getchar();}

}

const int maxn=;

int a[maxn],b[maxn],c[maxn],n,q;

map<int,int>m;

int main()

{

    scanf("%d",&n);

    for(int i=;i<=n;i++) {int x; scanf("%d",&x),m[x]++; }

    scanf("%d",&q);

    for(int i=;i<=q;i++) scanf("%d",&b[i]);

    for(int i=;i<=q;i++) scanf("%d",&c[i]);

    for(int i=;i<=q;i++) b[i]=m[b[i]],c[i]=m[c[i]];

    int mx=;

    for(int i=;i<=q;i++) mx=max(mx,b[i]);

    int ans=;

    for(int i=;i<=q;i++)

    {

        if(b[i]!=mx) continue;

        if(c[i]<c[ans]) continue;

        ans=i;

    }

    printf("%d\n",ans);

    return ;

}