#include <bits/stdc++.h>
using namespace std;
const int maxn = 200005;
map<string, int> f;
vector<pair<int, string> > v;
int n, cnt = 0;
int main() {
  scanf("%d", &n);
  for (int i = 0; i < n; ++i) {
    string s;
    cin >> s;
    f[s] = ++cnt;
  }
  for (map<string, int>::iterator it = f.begin(); it != f.end(); ++it) {
    v.push_back(make_pair(it->second, it->first));
  }
  sort(v.begin(), v.end(), greater<pair<int, string> >());
  for (int i = 0; i < v.size(); ++i) cout << v[i].second << "\n";
}
