#include <bits/stdc++.h>
const int mod = 1e9 + 7;
char nomes[200005][16];
char matriz[500001][16] = {};
int Hash(char* key) {
  long long i, tamkey, h = 0;
  long long int mult = 1;
  tamkey = strlen(key);
  for (i = 0; i < tamkey; i++) {
    h += (key[i] - 65) * mult;
    h %= mod;
    mult *= 10;
  }
  return h % 500000;
}
int find(char* nome, char matriz[500001][16]) {
  int key = Hash(nome);
  int ok = 0;
  while (ok == 0) {
    if (strcmp(matriz[key], "") == 0) return 0;
    if (strcmp(matriz[key], nome) == 0) return 1;
    key = (key + 1) % 500000;
  }
  return 0;
}
void insert(char* nome, char matriz[500001][16]) {
  int key = Hash(nome);
  while (strcmp(matriz[key], "") != 0) {
    key = (key + 1) % 500000;
  }
  strcpy(matriz[key], nome);
}
int main() {
  int n, a = 0, i, h;
  scanf("%d", &n);
  while (a < n) {
    scanf(" %[^\n]", nomes[a]);
    a++;
  }
  for (i = a - 1; i >= 0; i--) {
    if (find(nomes[i], matriz) == 0) {
      printf("%s\n", nomes[i]);
      insert(nomes[i], matriz);
    }
  }
  return 0;
}
