#include <bits/stdc++.h>
using namespace std;
static inline void canhazfast() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  cout.tie(nullptr);
}
template <typename T>
T gcd(T a, T b) {
  return b == 0 ? a : gcd(b, a % b);
}
template <typename T>
T extgcd(T a, T b, T &x, T &y) {
  T x0 = 1, y0 = 0, x1 = 0, y1 = 1;
  while (b) {
    T q = a / b;
    a %= b;
    swap(a, b);
    x0 -= q * x1;
    swap(x0, x1);
    y0 -= q * y1;
    swap(y0, y1);
  }
  x = x0;
  y = y0;
  return a;
}
static inline int ctz(unsigned x) { return __builtin_ctz(x); }
static inline int ctzll(unsigned long long x) { return __builtin_ctzll(x); }
static inline int clz(unsigned x) { return __builtin_clz(x); }
static inline int clzll(unsigned long long x) { return __builtin_clzll(x); }
static inline int popcnt(unsigned x) { return __builtin_popcount(x); }
static inline int popcntll(unsigned long long x) {
  return __builtin_popcountll(x);
}
static inline int bsr(unsigned x) { return 31 ^ clz(x); }
static inline int bsrll(unsigned long long x) { return 63 ^ clzll(x); }
int main() {
  canhazfast();
  static string s[70016];
  static set<string> x[70016];
  unordered_map<string, int> cnt;
  int n;
  cin >> n;
  for (int i = 0; i < n; ++i) {
    cin >> s[i];
    for (int b = 0; b < 9; ++b) {
      for (int e = b + 1; e <= 9; ++e) x[i].insert(s[i].substr(b, e - b));
    }
    for (const string &t : x[i]) ++cnt[t];
  }
  for (int i = 0; i < n; ++i) {
    int ans = 10;
    string r;
    for (const string &t : x[i]) {
      if (cnt[t] > 1) continue;
      int l = (int)t.size();
      if (ans > l) ans = l, r = t;
    }
    cout << r << '\n';
  }
  return 0;
}
