#include <bits/stdc++.h>
using namespace std;
int setBit(int n, int r) { return n | (1 << r); }
int resetBit(int n, int r) { return n & ~(1 << r); }
int checkBit(int n, int r) { return n & (1 << r); }
template <typename T>
T mod(T a, T b = 1000000007) {
  return (a % b) >= 0 ? (a % b) : (a % b) + b;
}
template <typename T>
T bigmod(T p, T e, T M) {
  T ret = 1;
  while (e > 0) {
    if (e % 2) ret = (ret * p) % M;
    p = (p * p) % M;
    e /= 2;
  }
  return ret;
}
template <typename T>
T power(T x, T y) {
  T ans = 1;
  while (y > 0) {
    if (y % 2) ans *= x;
    x *= x;
    y /= 2;
  }
  return ans;
}
template <typename T>
T gcd(T a, T b) {
  a = abs(a);
  b = abs(b);
  while (b != 0) {
    a = a % b;
    swap(a, b);
  }
  return a;
}
template <typename T>
T lcm(T a, T b) {
  return a * (b / gcd(a, b));
}
int n;
string s[200005];
set<string> st;
int main() {
  cin >> n;
  for (int i = 0; i < n; i++) cin >> s[i];
  for (int i = n - 1; i >= 0; i--) {
    if (st.count(s[i]) == 0) {
      cout << s[i] << endl;
      st.insert(s[i]);
    }
  }
}
