#include<stdio.h>
const int MAXN = 128;

int uniao( int A[], int tamA, int B[], int tamB, int C[] ){
    int i, j, tamC;
    tamC = 0;
    
    for(i = 0; i < tamA; i++)
            C[i] = A[i];
        
    
    for(j = 0; j < tamB; j++)
            C[tamA + j] = B[j];
    

    for(i = 0; i < tamA + tamB - 1; i++){
        for(j = i + 1; j < tamA + tamB; j++){
            if(C[i] == C[j]){
                    C[i] = C[i] - C[j];                
            }
        }
    }
    
       // return C[tamA + tamB];
}


/* Leitura e impressao - use para testar sua funcao */
int main(){
   int N, M;
   int A[MAXN];
   int B[MAXN];
   int C[2*MAXN];
   
   scanf("%d", &N);
   int i;
   for ( i = 0; i < N; ++i )
      scanf("%d", &A[i]);
   
   scanf("%d", &M);
   for ( i = 0; i < M; ++i )
      scanf("%d", &B[i]);

   int T = uniao( A, N, B, M, C );
   for ( i = 0; i < T; ++i )
      printf("%d ", C[i]);
   printf("\n");
   return 0;
}