#include <bits/stdc++.h>
using namespace std;
int main() {
  int n;
  string s;
  stack<string> stk;
  map<string, int> mp;
  cin >> n;
  while (n--) {
    cin >> s;
    stk.push(s);
  }
  while (!stk.empty()) {
    if (!mp[stk.top()]) {
      cout << stk.top() << endl;
      mp[stk.top()] = 1;
    }
    stk.pop();
  }
  return 0;
}
