#include <bits/stdc++.h>
using namespace std;
const int MAXN = 200005;
const int HUJ = 5002;
map<string, int> m;
vector<pair<int, int> > v;
vector<string> vs;
int main() {
  int k = 0;
  cin.sync_with_stdio(false);
  int n;
  cin >> n;
  for (int i = 0; i < n; i++) {
    string s;
    cin >> s;
    if (m.find(s) == m.end()) {
      int k = v.size();
      v.push_back({i, k});
      vs.push_back(s);
      m[s] = k;
    } else {
      int k = m[s];
      v[k] = {i, k};
    }
  }
  sort(v.begin(), v.end());
  for (int i = v.size() - 1; i >= 0; i--) {
    cout << vs[v[i].second] << "\n";
  }
  return 0;
}
