#include <bits/stdc++.h>
using namespace std;

using ll = long long;

signed main() {
    ios::sync_with_stdio(0);
    cin.tie(0), cout.tie(0);
    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];
    }
    vector<pair<int, int>> p0, p1;
    for(int i = 0; i < n; i++) {
        for(int j = 0; j < n; j++) {
            if(s[i][j] != t[i][j]) {
                if(s[i][j] == '#') {
                    p1.push_back({i, j});
                } else {
                    p0.push_back({i, j});
                }
            }
        }
    }
    if(p0.size() != p1.size()) {
        cout << "No\n";
        return 0;
    }
    vector<pair<int, int>> ans;
    auto row = [&](int i, int t) {
        while(t--) {
            ans.push_back({1, i});
            int tmp = s[i][n - 1];
            for(int j = n - 1; j; j--) {
                s[i][j] = s[i][j - 1];
            }
            s[i][0] = tmp;
        }
    };
    auto col = [&](int j, int t) {
        while(t--) {
            ans.push_back({2, j});
            int tmp = s[n - 1][j];
            for(int i = n - 1; i; i--) {
                s[i][j] = s[i - 1][j];
            }
            s[0][j] = tmp;
        }
    };
    auto rotate = [&](int i, int j, int r, int c, int ty) {
        // ty *= r * c;
        if(ty > 0) {
            row(i, r < 0 ? -r : n - r);
            col(j, c < 0 ? -c : n - c);
            row(i, r < 0 ? n + r : r);
            col(j, c < 0 ? n + c : c);
        } else {
            col(j, c < 0 ? -c : n - c);
            row(i, r < 0 ? -r : n - r);
            col(j, c < 0 ? n + c : c);
            row(i, r < 0 ? n + r : r);
        }
    };
    for(int _ = 0; _ < p0.size(); _++) {
        auto [x1, y1] = p0[_];
        auto [x2, y2] = p1[_];
        // cerr << '\n';
        // cerr << x1 << ' ' << y1 << ' ' << x2 << ' ' << y2 << '\n';
        if(x1 != x2 && y1 != y2) {
            rotate(x1, y2, y1 - y2, x2 - x1, s[x1][y1] == s[x1][y2] ? 1 : -1);
        } else if(x1 == x2) {
            x2 = (x2 + 1) % n;
            rotate(x1, y2, y1 - y2, x2 - x1, s[x1][y1] == s[x1][y2] ? 1 : -1);
        } else {
            y1 = (y1 + 1) % n;
            rotate(x1, y2, y1 - y2, x2 - x1, s[x1][y1] != s[x1][y2] ? 1 : -1);
        }
        // for(int i = 0; i < n; i++) {
        //     for(int j = 0; j < n; j++) {
        //         cerr << s[i][j];
        //     }
        //     cerr << '\n';
        // }
    }
    cout << "Yes\n";
    cout << ans.size() << '\n';
    for(auto [x, y] : ans) {
        cout << x << ' ' << y + 1 << '\n';
    }
    return 0;
}
/*
3
.#.
#.#
.#.
#.#
...
#.#


4
..#.
#..#
.#..
#.#.
.#..
....
...#
####

*/