int tomb_tartalmaz(int *t, int n, int ertek) {
int i;
for (i = 0; i < n; ++i)
if (*(t+i) == ertek)
return 1;
return 0;
}
void tomb_rendez(int *t, int n) {
int i, j;
for (i = 0; i < n-1; ++i)
for (j = n - 2; j >= i; --j)
if (*(t+j) > *(t+j + 1))
{
int tmp = *(t+j);
*(t+j) = *(t+j + 1);
*(t+j + 1) = tmp;
}
}
int main() {
int n, i, t1_e=0, t2_e=0, t3_e=0;
int *t1, *t2, *t3;
scanf("%d", &n);
t1 = (int*) malloc(n * sizeof(int));
t2 = (int*) malloc(n * sizeof(int));
while (t1_e < n && scanf("%d", &t1[t1_e]) != EOF)
++t1_e;
while (t2_e < n && scanf("%d", &t2[t2_e]) != EOF)
++t2_e;
t3 = (int*) malloc(n * sizeof(int));
for (i = 0; i < t1_e; ++i)
if (!tomb_tartalmaz(t2, t2_e, t1[i]) &&
!tomb_tartalmaz(t3, t3_e, t1[i]))
t3[t3_e++] = t1[i];
tomb_rendez(t3, t3_e);
for (i = 0; i < t3_e; ++i)
printf("%d\n", t3[i]);
free(t1);
free(t2);
free(t3);
return 0;
}