​传送门​​ 

#include<bits/stdc++.h>
#define N 200005
using namespace std;
int a[N],b[N],c[N],x[N*3],ans;
int n,m,tot,siz,num[N],joy[N],sat[N];
int read(){
int cnt=0;char ch=0;
while(!isdigit(ch))ch=getchar();
while(isdigit(ch))cnt=cnt*10+(ch-'0'),ch=getchar();
return cnt;
}
int main(){
n=read();
for(int i=1;i<=n;i++) x[++tot]=a[i]=read();
m=read();
for(int i=1;i<=m;i++) x[++tot]=b[i]=read();
for(int i=1;i<=m;i++) x[++tot]=c[i]=read();
siz = unique(x+1,x+tot+1) - (x+1);
for(int i=1;i<=n;i++){
int now=lower_bound(x+1,x+siz+1,a[i])-x;
num[now]++;
}
for(int i=1;i<=m;i++){
joy[i] = num[lower_bound(x+1,x+siz+1,b[i])-x];
sat[i] = num[lower_bound(x+1,x+siz+1,c[i])-x];
if(joy[i] > joy[ans]) ans=i;
if(joy[i]==joy[ans] && sat[i]>sat[ans]) ans=i;
}printf("%d",ans); return 0;
}