#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f;
const unsigned long long LINF = 0x3f3f3f3f3f3f3f3fll;
int main(void) {
  int n;
  cin >> n;
  unordered_map<string, int> m;
  for (int i = 0; i < n; ++i) {
    string s;
    cin >> s;
    m[s] = i + 1;
  }
  vector<pair<string, int> > v;
  for (auto& e : m) v.push_back(e);
  sort(v.begin(), v.end(), [](pair<string, int>& a, pair<string, int>& b) {
    return a.second > b.second;
  });
  for (auto& e : v) {
    cout << e.first << '\n';
  }
  return (0);
}
