#include<iostream>#include<cmath>#include<cstring>#include<cstdio>#include<algorithm>usingnamespacestd;
constint maxn=5005;
int f[maxn][maxn],g[maxn][maxn],fa[maxn][maxn];
int n,i,t,j,k,x,y,m,a[maxn],b[maxn],ans,p,c[maxn];
int main(){
// freopen("data.in","r",stdin);freopen("data.out","w",stdout);scanf("%d",&n);
for (i=1;i<=n;i++)
scanf("%d",&a[i]);
scanf("%d",&m);
for (i=1;i<=m;i++)
scanf("%d",&b[i]);
for (i=1;i<=n;i++)
for (j=1;j<=m;j++){
if (a[i]==b[j]){
f[i][j]=f[i-1][g[i][j]]+1;
fa[i][j]=g[i][j];
if (f[i][j]>ans) p=i*maxn+j;
ans=max(ans,f[i][j]);
}
else f[i][j]=f[i-1][j],fa[i][j]=j;
g[i+1][j]=g[i+1][j-1];
if (b[j]<a[i+1] && f[i][g[i+1][j]]<f[i][j]) g[i+1][j]=j;
}
printf("%d\n",ans);t=0;
x=p/maxn;
y=p%maxn;
while (x){
t=fa[x][y];
if (f[x][y]!=f[x-1][t]) c[++c[0]]=a[x];
y=t;x--;
}
for (i=c[0];i>0;i--)
printf("%d ",c[i]);
}