// yuki 938 賢人を探せ
// 2019.12.5 bal4u

#include <stdio.h>
#include <string.h>

typedef long long ll;
#define gc() getchar_unlocked()
#define pc(c) putchar_unlocked(c)

int in() {   // 非負整数の入力
	int n = 0, c = gc();
	do n = 10 * n + (c & 0xf); while ((c = gc()) >= '0');
	return n;
}

void ins(char *s) { // 文字列の入力　スペース以下の文字で入力終了
	do *s = gc();
	while (*s++ > ' ');
	*(s-1) = 0;
}

void outs(char *s) { while (*s) pc(*s++); pc('\n'); }

// 文字列のハッシュ関数
#define HASHSIZ 199999
typedef ll HASH;
ll hash[HASHSIZ+5], *hashend = hash+HASHSIZ;

void insert(char *s) {
	ll j = 0; while (*s) j = (j << 6) + (*s++ - 0x40);
	HASH *p = hash + (int)(j % HASHSIZ);
	while (*p) {
		if (*p == j) return;
		if (++p == hashend) p = hash;
	}
	*p = j;
}

int lookup(char *s) {
	ll j = 0; while (*s) j = (j << 6) + (*s++ - 0x40);
	HASH *p = hash + (int)(j % HASHSIZ);
	while (*p) {
		if (*p == j) return 1;
		if (++p == hashend) p = hash;
	}
	return 0;
}

int w;
char A[20005][12], B[20005][12];

int main()
{
	int i, n, N;
	
	N = in();
	for (i = 0; i < N; ++i) {
		ins(A[i]), insert(A[i]);
		ins(B[i]);
	}
	n = N; for (i = 0; i < N; ++i) {
		if (!lookup(B[i])) {
			outs(B[i]);
			insert(B[i]);
		}
	}
	return 0;
}