int main(){
int a[11];
int b[11];
int i;
int j;
printf("input the a[]:\n");
for(i=0;i<11;i++){
scanf("%d",&a[i]);
printf("");
}

printf("input the b[]:\n");
for(i=0;i<11;i++){
scanf("%d",&b[i]);
printf("");
}
int common=1000;

for(i=0;i<11;i++){
    for(j=0;j<11;j++){
        if(a[i]==b[j]){

            a[i]=common;
        }
        if(a[j]==b[i]){
            b[i]=common;
        }
    }
}
int record=0;
    //sum the zero number
        //remove the unnecessary zero
for(j=0;j<11;j++){
    if(a[j]!=common){
        record++;
    }

}
int share[record];
int test=0;
for(j=0;j<11;j++){
    if(a[j]!=common){
     share[test]=a[j];
     test++;
    }

}
//prevent the same number exist in the share
int recordsec=0;//record the repeat number
for(i=0;i<record-1;i++){
    for(j=i+1;j<record;j++){
        if(share[i]==share[j]){
            share[j]=common;
            recordsec++;
        }
    }
}
//extract the final result array "final"
int finum=record-recordsec;
int final[finum];
int addrec=0;
for(i=0;i<finum;i++){
    if(share[i]!=common){
        final[addrec]=share[i];
        addrec++;
    }
}
for(i=0;i<finum;i++){
    printf("%d",final[i]);
    printf(" ");
}
return 0;

}