#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#include <algorithm>

using namespace std;
typedef long long ll;

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  int n;
  cin >> n;
  vector<vector<int>> active(n, vector<int>(n));
  vector<int> r(n), c(n);
  for (int i = 0; i < n; ++i) {
    for (int j = 0; j < n; ++j) {
      char cc;
      cin >> cc;
      if (cc == '-') {
        active[i][j] = 1;
        r[i] += 1;
        c[j] += 1;
      }
    }
  }
  int sum_rows = 0, sum_cols = 0;
  bool bad = false;
  vector<vector<int>> who_r(n + 1);
  for (int i = 0; i <= n; ++i) {
    who_r[i].reserve(n);
  }
  for (int i = 0; i < n; ++i) {
    int x;
    cin >> x;
    r[i] += x;
    if (r[i] < 0 || r[i] > n) {
      bad = true;
      break;
    }
    who_r[r[i]].push_back(i);
    sum_rows += r[i];
  }
  for (int i = 0; i < n; ++i) {
    int x;
    cin >> x;
    c[i] += x;
    if (c[i] < 0 || c[i] > n) {
      bad = true;
      break;
    }
    sum_cols += c[i];
  }
  if (bad || sum_rows != sum_cols) {
    cout << "No\n";
    return 0;
  }
  vector<int> pos(n);
  iota(pos.begin(), pos.end(), 0);
  sort(pos.begin(), pos.end(), [&](int i, int j) {
    return c[i] > c[j];
  });
  vector<int> who;
  who.reserve(n);
  for (int i : pos) {
    for (int j = n; j > 0; --j) {
      while (!who_r[j].empty() && c[i] > 0) {
        --c[i];
        int x = who_r[j].back();
        active[x][i] ^= 1;
        who_r[j].pop_back();
        --r[x];
        who.push_back(x);
      }
    }
    if (c[i] > 0) {
      bad = true;
      break;
    }
    for (auto x : who) {
      who_r[r[x]].push_back(x);
    }
    who.clear();
  }
  if (!bad) {
    cout << "Yes\n";
    for (int i = 0; i < n; ++i) {
      for (int j = 0; j < n; ++j) {
        cout << active[i][j];
      }
      cout << '\n';
    }
  } else {
    cout << "No\n";
  }
}