#include <bits/stdc++.h>
using namespace std;
long long b_power(long long a, long long b);
long long min_div(long long n);
int is_prime(long long n);
long long ncr(long long n, long long c);
long long b_power(long long a, long long b) {
  long long res = 1;
  while (b > 0) {
    if (b & 1) res = res * a;
    a = a * a;
    b >>= 1;
  }
  return res;
}
long long min_div(long long n) {
  for (long long i = 2; i * i <= n; i++) {
    if (n % i == 0) {
      return i;
    }
  }
  return n;
}
int is_prime(long long n) {
  if (n == 2) return 1;
  for (long long i = 2; i * i <= n; i++) {
    if (n % i == 0) return 0;
  }
  return 1;
}
long long ncr(long long n, long long c) {
  long long t = 1;
  c = min(c, n - c);
  for (long long i = 1; i <= c; i++) t = (t * (n - i + 1)) / i;
  return t;
}
int main() {
  ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
  srand(time(NULL));
  int n, i;
  cin >> n;
  string a[n];
  for (i = 0; i < n; i++) cin >> a[i];
  unordered_map<string, int> y;
  for (i = n - 1; i >= 0; i--) {
    y[a[i]]++;
    if (y[a[i]] == 1)
      cout << a[i] << endl;
    else {
    }
  }
}
