#include <bits/stdc++.h>

using namespace std;

int main() {
    cin.tie(0)->sync_with_stdio(false);
    int n;
    cin >> n;
    vector<pair<int, int>> r(n), c(n);
    vector<vector<int>> res(n, vector<int>(n, 0));
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < n; ++j) {
            char x;
            cin >> x;
            if (x == '-') {
                r[i].first++, c[j].first++;
                res[i][j] = 1;
            }
        }
    }
    int a = 0, b = 0;
    for (int i = 0; i < n; ++i) {
        int x;
        cin >> x;
        r[i].first += x;
        r[i].second = i;
        a += r[i].first;
        if (r[i].first < 0 || r[i].first > n) {
            cout << "No\n";
            return 0;
        }
    }
    priority_queue<pair<int, int>> pq;
    for (int i = 0; i < n; ++i) {
        int x;
        cin >> x;
        c[i].first += x;
        c[i].second = i;
        b += c[i].first;
        if (c[i].first < 0 || c[i].first > n) {
            cout << "No\n";
            return 0;
        }
        if (c[i].first)pq.push(c[i]);
    }
    if (a != b) {
        cout << "No\n";
        return 0;
    }
    mt19937 rng(1);
    shuffle(r.begin(),r.end(),rng);
    for (int i = 0; i < n; ++i) {
        vector<pair<int, int>> todo;
        while (r[i].first) {
            if (pq.empty()) {
                cout << "No\n";
                return 0;
            }
            auto [x, who] = pq.top();
            pq.pop();
            --r[i].first;
            res[r[i].second][who] ^= 1;
            if (--x)todo.push_back({x, who});
        }
        for (auto p: todo)pq.push(p);
    }
    cout << "Yes\n";
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < n; ++j) {
            cout << res[i][j];
        }
        cout << "\n";
    }
    return 0;
}