#include <iostream>
#include <algorithm>
using namespace std;
bool caut_bin(int x, int v[], int n)
{
int st = 0, dr = n;
while (st <= dr)
{
int m = (st + dr) / 2;
if (x == v[m])
{
return true;
}
if (x < v[m])
{
dr = m - 1;
}
else
{
st = m + 1;
}
}
return false;
}
int main()
{
int n, a[1001], b[1001];
cin >> n;
for (int i = 0; i < n; ++i)
{
cin >> a[i];
}
for (int i = 0; i < n - 1; ++i)
{
cin >> b[i];
}
//Sortam crescator cele 2 siruri
sort(a, a + n);
sort(b, b + n - 1);
for (int i = 0; i < n; ++i)
{
if (!caut_bin(a[i], b, n - 1)) //daca nu s-a gasit elementul a[i] in sirul b
{
cout << a[i] << " ";
}
}
return 0;
}
