#include <bits/stdc++.h>

using namespace std;

#ifdef DEBUG
  #include "debug.hpp"
#else
  #define dbg(...) 0
#endif

vector<vector<bool>> solve2(const vector<int>& rowsum, const vector<int>& colsum) {
  int n = rowsum.size();
  vector<vector<int>> by_cnt(n + 1);
  for (int i = 0; i < n; ++i) {
    if (rowsum[i] < 0) return {};
    if (colsum[i] < 0) return {};
    if (rowsum[i] > n) return {};
    if (colsum[i] > n) return {};
    by_cnt[colsum[i]].push_back(i);
  }
  vector<vector<bool>> ans(n, vector<bool>(n, false));
  int r = n;
  vector<pair<int, int>> reins; reins.reserve(n);
  for (int i = 0; i < n; ++i) {
    reins.clear();
    for (int j = 0; j < rowsum[i]; ++j) {
      while ((r > 0) && by_cnt[r].empty()) r--;
      if (r == 0) return {};
      int col = by_cnt[r].back();
      by_cnt[r].pop_back();
      if (r > 1) {
        reins.emplace_back(col, r - 1);
      }
      ans[i][col] = true;
    }
    for (auto [col, rr] : reins) {
      by_cnt[rr].push_back(col);
      r = max(r, rr);
    }
  }
  return ans;
}

vector<vector<bool>> solve(const vector<vector<bool>>& a, const vector<int>& rowsum, const vector<int>& colsum) {
  int n = a.size();
  {
    int sum = 0;
    for (int i = 0; i < n; ++i) {
      sum += rowsum[i] - colsum[i];
    }
    if (sum != 0) return {};
  }
  vector<vector<bool>> negs(n, vector<bool>(n, false));
  vector<int> rsum = rowsum, csum = colsum;
  for (int i = 0; i < n; ++i) {
    for (int j = 0; j < n; ++j) {
      if (!a[i][j]) {
        rsum[i]++;
        csum[j]++;
        negs[i][j] = true;
      }
    }
  }
  vector<vector<bool>> ans = solve2(rsum, csum);
  if (ans.empty()) return {};
  for (int i = 0; i < n; ++i) {
    for (int j = 0; j < n; ++j) {
      ans[i][j] = ans[i][j] ^ negs[i][j];
    }
  }
  return ans;
}

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int n;
  cin >> n;
  vector<vector<bool>> a(n, vector<bool>(n));
  for (int i = 0; i < n; ++i) {
    string s;
    cin >> s;
    assert(int(s.size()) == n);
    for (int j = 0; j < n; ++j) {
      a[i][j] = (s[j] == '+');
    }
  }
  vector<int> rowsum(n), colsum(n);
  for (int i = 0; i < n; ++i) {
    cin >> rowsum[i];
  }
  for (int i = 0; i < n; ++i) {
    cin >> colsum[i];
  }
  vector<vector<bool>> ans = solve(a, rowsum, colsum);
  if (ans.empty()) {
    cout << "No\n";
  }
  else {
    cout << "Yes\n";
    for (int i = 0; i < n; ++i) {
      for (int j = 0; j < n; ++j) {
        cout << ans[i][j];
      }
      cout << '\n';
    }
  }
}