#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll myRand(ll B) { return (ull)rng() % B; }

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int n;
    cin >> n;
    vector<string> s(n), t(n);
    for (int i = 0; i < n; ++i) {
        cin >> s[i];
    }
    for (int i = 0; i < n; ++i) {
        cin >> t[i];
    }
    int cnt_s = 0, cnt_t = 0;
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < n; ++j) {
            cnt_s += (s[i][j] == '#');
        }
    }
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < n; ++j) {
            cnt_t += (t[i][j] == '#');
        }
    }
    if (cnt_s != cnt_t) {
        cout << "No" << endl;
        return 0;
    }
    if (n * n - cnt_s < cnt_s) {
        for (int i = 0; i < n; ++i) {
            for (int j = 0; j < n; ++j) {
                if (s[i][j] == '#') s[i][j] = '.';
                else s[i][j] = '#';
            }
        }
        for (int i = 0; i < n; ++i) {
            for (int j = 0; j < n; ++j) {
                if (t[i][j] == '#') t[i][j] = '.';
                else t[i][j] = '#';
            }
        }
        cnt_s = n * n - cnt_s;
        cnt_t = n * n - cnt_t;
    }

    vector<pair<int, int>> res1, res2;

    auto op1 = [&](int t, int x) -> void {
        res1.emplace_back(t, x);
        if (t == 1) {
            char c = s[x][n - 1];
            for (int i = n - 1; i > 0; --i) {
                s[x][i] = s[x][i - 1];
            }
            s[x][0] = c;
        } else {
            char c = s[n - 1][x];
            for (int i = n - 1; i > 0; --i) {
                s[i][x] = s[i - 1][x];
            }
            s[0][x] = c;
        }
    };
    auto clean1 = [&]() -> void {
        int cnt = 0;
        for (int i = 0; i < n; ++i) {
            cnt += (s[i][n - 1] == '#');
        }
        for (int i = n - 1; i >= cnt_s / (n - 1); --i) {
            while (cnt < n) {
                int jj = -1;
                for (int j = n - 2; j >= 0; --j) {
                    if (s[i][j] == '#') {
                        jj = j;
                        break;
                    }
                }
                if (jj == -1) break;
                while (s[i][n - 1] == '#') {
                    op1(2, n - 1);
                }
                for (int j = 0; j < (n - 1) - jj; ++j) {
                    op1(1, i);
                }
                cnt += 1;
            }
        }
    };
    for (int i = 0; i < cnt_s / (n - 1); ++i) {
        clean1();
        while (true) {
            bool ok = true;
            for (int j = 0; j < n - 1; ++j) {
                if (s[i][j] != '#') {
                    ok = false;
                    break;
                }
            }
            if (ok) break;
            while (s[i][n - 1] != '#') {
                op1(2, n - 1);
            }
            op1(1, i);
        }
    }
    clean1();
    while (true) {
        bool ex = false;
        for (int i = 0; i < n; ++i) {
            if (s[i][n - 1] == '#') {
                ex = true;
                break;
            }
        }
        if (!ex) break;
        while (s[cnt_s / (n - 1)][n - 1] != '#') {
            op1(2, n - 1);
        }
        op1(1, cnt_s / (n - 1));
    }

    auto op2 = [&](int type, int x) -> void {
        res2.emplace_back(type, x);
        if (type == 1) {
            char c = t[x][0];
            for (int i = 0; i < n - 1; ++i) {
                t[x][i] = t[x][i + 1];
            }
            t[x][n - 1] = c;
        } else {
            char c = t[0][x];
            for (int i = 0; i < n - 1; ++i) {
                t[i][x] = t[i + 1][x];
            }
            t[n - 1][x] = c;
        }
    };
    auto clean2 = [&]() -> void {
        int cnt = 0;
        for (int i = 0; i < n; ++i) {
            cnt += (t[i][n - 1] == '#');
        }
        for (int i = n - 1; i >= cnt_s / (n - 1); --i) {
            while (cnt < n) {
                int jj = -1;
                for (int j = 0; j < n - 1; j++) {
                    if (t[i][j] == '#') {
                        jj = j;
                        break;
                    }
                }
                if (jj == -1) break;
                while (t[i][n - 1] == '#') {
                    op2(2, n - 1);
                }
                for (int j = 0; j < jj + 1; ++j) {
                    op2(1, i);
                }
                cnt += 1;
            }
        }
    };
    for (int i = 0; i < cnt_s / (n - 1); ++i) {
        clean2();
        while (true) {
            bool ok = true;
            for (int j = 0; j < n - 1; ++j) {
                if (t[i][j] != '#') {
                    ok = false;
                    break;
                }
            }
            if (ok) break;
            while (t[i][n - 1] != '#') {
                op2(2, n - 1);
            }
            op2(1, i);
        }
    }
    clean2();
    while (true) {
        bool ex = false;
        for (int i = 0; i < n; ++i) {
            if (t[i][n - 1] == '#') {
                ex = true;
                break;
            }
        }
        if (!ex) break;
        while (t[cnt_s / (n - 1)][n - 1] != '#') {
            op2(2, n - 1);
        }
        op2(1, cnt_s / (n - 1));
    }
    if (cnt_s % (n - 1)) {
        while (t[cnt_s / (n - 1)][0] != '#') {
            op2(1, cnt_s / (n - 1));
        }
    }

    reverse(res2.begin(), res2.end());
    cout << "Yes" << endl;
    cout << res1.size() + res2.size() << endl;
    for (auto [x, y] : res1) {
        cout << x << " " << y + 1 << endl;
    }
    for (auto [x, y] : res2) {
        cout << x << " " << y + 1 << endl;
    }
}