#include <bits/stdc++.h>
using namespace std;
bool isprime(long long n) {
  if (n <= 1) return false;
  if (n <= 3) return true;
  if (n % 2 == 0 || n % 3 == 0) return false;
  for (long long i = 5; i * i <= n; i += 6) {
    if (n % i == 0 || n % (i + 2) == 0) return false;
  }
  return true;
}
long long modexp(long long a, long long b, long long m) {
  long long r = 1;
  a = a % m;
  while (b > 0) {
    if (b & 1) r = (r * a) % m;
    b = b >> 1;
    a = (a * a) % m;
  }
  return r % m;
}
long long builtin_popcount(long long x) {
  long long cnt = 0;
  for (long long i = 60; i >= 0; i--) {
    if ((1LL << i) & x) cnt++;
  }
  return cnt;
}
long long addmod(long long a, long long b, long long r) {
  a %= r;
  b %= r;
  return (a + b) % r;
}
long long mulmod(long long a, long long b, long long r) {
  a %= 1000000007;
  b %= 1000000007;
  return (a * b) % 1000000007;
}
long long submod(long long a, long long b) {
  a %= 1000000007;
  b %= 1000000007;
  a -= b;
  if (a < 0) a += 1000000007;
  return a % 1000000007;
}
struct CustomCompare {
  bool operator()(long long a, long long b) { return a > b; }
};
bool fix(string &curr, string &prev) {
  if (curr.size() < prev.size()) return false;
  if (curr.size() > prev.size()) {
    for (int i = 0; i < curr.size(); i++)
      if (curr[i] == '?') curr[i] = '0' + !i;
    return true;
  }
  string temp;
  for (long long i = 0; i < curr.size(); i++) {
    if (curr[i] == '?') {
      temp = curr;
      for (long long j = i + 1; j < curr.size(); j++)
        if (temp[j] == '?') temp[j] = '9';
      for (char j = '0'; j <= '9'; j++) {
        temp[i] = j;
        if (temp > prev) break;
      }
      curr[i] = temp[i];
    }
  }
  return curr > prev;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long n;
  cin >> n;
  vector<string> arr(n);
  for (int i = 0; i < n; i++) cin >> arr[i];
  vector<string> ans;
  string prev;
  bool flag = true;
  for (int i = 0; i < n; i++) {
    if (!fix(arr[i], prev)) {
      cout << "NO\n";
      return 0;
    }
    prev = arr[i];
    ans.push_back(prev);
  }
  cout << "YES\n";
  for (auto x : ans) cout << x << "\n";
  return 0;
}
