#include<cstdio>

typedef long long ll;

const int N=200010,P=31,D=1000173169;

int n,m,i,j,k,pow[N],a[N],b[N],f[N],g[N];

inline void read(int&a){char c;while(!(((c=getchar())>='0')&&(c<='9')));a=c-'0';while(((c=getchar())>='0')&&(c<='9'))(a*=10)+=c-'0';}

inline int hash0(int l,int r){return(ll)(f[r]-(ll)f[l-1]*pow[r-l+1]%D+D)%D;}

inline int hash1(int l,int r){return(ll)(g[r]-(ll)g[l-1]*pow[r-l+1]%D+D)%D;}

inline int ask(int a,int b){

  int l=1,r=n-a+1,mid,t=0;

  if(m-b+1<r)r=m-b+1;

  while(l<=r){

    mid=(l+r)>>1;

    if(hash0(a,a+mid-1)==hash1(b,b+mid-1))l=(t=mid)+1;else r=mid-1;

  }

  return t;

}

int main(){

  for(pow[0]=i=1;i<N;i++)pow[i]=(ll)pow[i-1]*P%D;

  for(read(n),i=1;i<=n;i++)read(a[i]),f[i]=((ll)f[i-1]*P+a[i])%D;

  for(read(m),i=1;i<=m;i++)read(b[i]),g[i]=((ll)g[i-1]*P+b[i])%D;

  for(a[n+1]=b[m+1]=1000,i=j=1;i<=n&&j<=m;printf("%d ",a[i+k]<b[j+k]?a[i++]:b[j++]))k=ask(i,j);

  while(i<=n)printf("%d ",a[i++]);

  while(j<=m)printf("%d ",b[j++]);

  return 0;

}