PAT1065

#include<iostream>
#include <iomanip>
#include <cstdio>
#include<string>
#include<vector>
#include<array>
#include<math.h>
#include <ctype.h>
#include<algorithm>
#include <set>
using namespace std;

int main()
{
	int i,j,a[100001] = { 0 }, b[10001], c[10001];
	int m, n, x, y, number = 0;
	cin >> n;
	for (i = 0; i < n; i++) 
	{
		cin >> x >> y;
		a[x] = y;
		a[y] = x;
	}
	cin >> m;
	for (i = 0; i < m; i++)
		cin >> b[i];
	for (i = 0; i < m; i++) 
	{
		int flag = 0;
		for (j = 0; j < m; j++)
			if (a[b[i]] == b[j]) 
			{
				flag = 1;
				break;
			}
		if (!flag) 
		{
			c[number] = b[i];
			number++;
		}
	}
	if (number == 0)
		cout << 0;
	else {
		sort(c, c + number);
		cout << number << "\n";
		printf("%05d", c[0]);
		for (int i = 1; i < number; i++)
			printf(" %05d", c[i]);
	}
	return 0;
}