#include <bits/stdc++.h>
using namespace std;
const long long int N = 1e5 + 5, mod = 1e9 + 7;
int n, x;
vector<string> v, ans, tmp, v2;
int m = N, y = 0, p;
stack<string> st;
queue<string> q;
string a[2000000];
int main() {
  ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  unordered_set<string> se;
  cin >> n;
  unordered_map<string, int> um;
  for (int i = 0; i < n; i++) {
    cin >> a[i];
  }
  for (int i = n - 1; i >= 0; i--) {
    if (!um[a[i]]) cout << a[i] << endl, um[a[i]]++;
  }
  return 0;
}
