#include <bits/stdc++.h>
using namespace std;
const int INF = 2000000000;
struct Edge {
  int from, to, cap, flow, index;
  Edge(int fr, int t, int c, int fl, int i)
      : from(fr), to(t), cap(c), flow(fl), index(i) {}
};
struct Dinic {
  int N;
  vector<vector<Edge>> G;
  vector<Edge *> dad;
  vector<int> Q;
  Dinic(int NN) : N(NN), G(NN), dad(NN), Q(NN) {}
  void AddEdge(int from, int to, int cap = 1) {
    G[from].push_back(Edge(from, to, cap, 0, G[to].size()));
    if (from == to) G[from].back().index++;
    G[to].push_back(Edge(to, from, 0, 0, G[from].size() - 1));
  }
  long long BlockingFlow(int s, int t) {
    fill(dad.begin(), dad.end(), (Edge *)NULL);
    dad[s] = &G[0][0] - 1;
    int head = 0, tail = 0;
    Q[tail++] = s;
    while (head < tail) {
      int x = Q[head++];
      for (int i = 0; i < (int)G[x].size(); i++) {
        Edge &e = G[x][i];
        if (!dad[e.to] && e.cap - e.flow > 0) {
          dad[e.to] = &G[x][i];
          Q[tail++] = e.to;
        }
      }
    }
    if (!dad[t]) return 0;
    long long totflow = 0;
    for (int i = 0; i < (int)G[t].size(); i++) {
      Edge *start = &G[G[t][i].to][G[t][i].index];
      int amt = INF;
      for (Edge *e = start; amt && e != dad[s]; e = dad[e->from]) {
        if (!e) {
          amt = 0;
          break;
        }
        amt = min(amt, e->cap - e->flow);
      }
      if (amt == 0) continue;
      for (Edge *e = start; amt && e != dad[s]; e = dad[e->from]) {
        e->flow += amt;
        G[e->to][e->index].flow -= amt;
      }
      totflow += amt;
    }
    return totflow;
  }
  long long GetMaxFlow(int s, int t) {
    long long totflow = 0;
    while (long long flow = BlockingFlow(s, t)) totflow += flow;
    return totflow;
  }
};
int n;
map<string, vector<int>> ms1, ms2;
int main() {
  cin >> n;
  for (int i = 0; i < int(n); i++) {
    string a, b;
    cin >> a >> b;
    string fst = a.substr(0, 3);
    string snd = a.substr(0, 2) + b.substr(0, 1);
    ms1[fst].push_back(i);
    ms2[snd].push_back(i);
  }
  vector<string> to_delete;
  for (auto const &e : ms1) {
    if (e.second.size() == 1) ms2[e.first].push_back(e.second[0]);
  }
  vector<string> abrv;
  for (auto const &e : ms2) {
    abrv.push_back(e.first);
  }
  sort(begin(abrv), end(abrv));
  int T = n + int(abrv.size()) + 1;
  Dinic D(1 + T);
  for (int i = 0; i < int(n); i++) {
    D.AddEdge(0, i + 1);
  }
  for (int i = 0; i < int(abrv.size()); i++) {
    D.AddEdge(T - i - 1, T);
  }
  for (auto const &e : ms2) {
    int index = int(lower_bound(begin(abrv), end(abrv), e.first) - begin(abrv));
    for (int team : e.second) {
      D.AddEdge(team + 1, 1 + n + index);
    }
  }
  long long int f = D.GetMaxFlow(0, T);
  if (f == n) {
    cout << "YES\n";
    vector<string> res(n);
    for (auto const &e : ms2) {
      int index =
          int(lower_bound(begin(abrv), end(abrv), e.first) - begin(abrv));
      for (Edge &edge : D.G[1 + n + index]) {
        if (edge.to != T && edge.flow) {
          res[edge.to - 1] = e.first;
        }
      }
    }
    for (string &s : res) {
      cout << s << "\n";
    }
  } else {
    cout << "NO\n";
  }
}
