#include <bits/stdc++.h>
using namespace std;
vector<string> a;
int n, j;
string s;
map<long long, int> f;
long long h(string s) {
  long long res = 0;
  for (int i = 0; i < s.length(); i++) res = res * 28 + (s[i] - 'a') + 1;
  return res;
}
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) {
    cin >> s;
    a.push_back(s);
  }
  long long j;
  for (int i = n - 1; i >= 0; i--) {
    j = h(a[i]);
    f[j]++;
    if (f[j] == 1) cout << a[i] << endl;
  }
  return 0;
}
