#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <unordered_map>
#include <vector>

using namespace std;

// BEGIN NO SAD
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define trav(a, x) for(auto& a : x)
#define all(x) x.begin(), x.end()
#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define lb lower_bound
#define ub upper_bound
typedef vector<int> vi;
#define f first
#define s second
#define derr if(0) cerr
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}
 
template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ", "; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? ", " : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#define debug(x...) cerr << "\e[91m"<<__func__<<":"<<__LINE__<<" [" << #x << "] = ["; _print(x); cerr << "\e[39m" << flush;
// END NO SAD

template<class Fun>
class y_combinator_result {
  Fun fun_;
public:
  template<class T>
  explicit y_combinator_result(T &&fun): fun_(std::forward<T>(fun)) {}

  template<class ...Args>
  decltype(auto) operator()(Args &&...args) {
    return fun_(std::ref(*this), std::forward<Args>(args)...);
  }
};

template<class Fun>
decltype(auto) y_combinator(Fun &&fun) {
  return y_combinator_result<std::decay_t<Fun>>(std::forward<Fun>(fun));
}

template<class T>
bool updmin(T& a, T b) {
  if(b < a) {
    a = b;
    return true;
  }
  return false;
}
template<class T>
bool updmax(T& a, T b) {
  if(b > a) {
    a = b;
    return true;
  }
  return false;
}
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

int cnt(vector<string>& g) {
  int r = 0;
  for(auto& a: g) for(auto b: a) r += b == '#';
  return r;
}
void solve() {
  int n;
  cin >> n;
  vector<string> a(n), b(n);
  auto shiftr = [&](int row, int amt) -> void {
    string curr = "";
    for(int i = 0; i < n; i++) curr += a[row][i];
    for(int i = 0; i < n; i++) a[row][(i+amt)%n] = curr[i];
  };
  auto shiftd = [&](int col, int amt) -> void {
    string curr = "";
    for(int i = 0; i < n; i++) curr += a[i][col];
    for(int i = 0; i < n; i++) a[(i+amt)%n][col] = curr[i];
  };
  for(int i = 0; i < n; i++) cin >> a[i];
  for(int i = 0; i < n; i++) cin >> b[i];
  if(cnt(a) != cnt(b)) return void(cout << "No\n");
  cout << "Yes\n";
  vector<array<int, 2>> abad, bbad;
  for(int i = 0; i < n; i++) {
    for(int j = 0; j < n; j++) {
      if(a[i][j] == b[i][j]) continue;
      if(a[i][j] == '#') abad.pb({i, j});
      if(b[i][j] == '#') bbad.pb({i, j});
    }
  }
  vector<array<int, 2>> ops;
  assert(sz(abad) == sz(bbad));
  auto doop = [&](int aa, int bb, int n) -> void {
    for(int i = 0; i < n; i++) {
      ops.pb({aa, bb+1});
    }
  };
  auto rot = [&](int xa, int ya, int xb, int yb, bool orient) -> void {
    if(orient) {
      doop(1, xa, (yb - ya + n) % n);
      doop(2, yb, (xa - xb + n) % n);
      doop(1, xa, (ya - yb + n) % n);
      doop(2, yb, (xb - xa + n) % n);
    }
    else {
      doop(2, yb, (xa - xb + n) % n);
      doop(1, xa, (yb - ya + n) % n);
      doop(2, yb, (xb - xa + n) % n);
      doop(1, xa, (ya - yb + n) % n);
    }
  };
  for(int i = 0; i < sz(abad); i++) {
    auto [xa, ya] = abad[i];
    auto [xb, yb] = bbad[i];
    if(xa != xb && ya != yb) {
      rot(xa, ya, xb, yb, a[xa][yb] == '#');
    }
    else if(xa == xb) {
      rot(xa, ya, (xa+1)%n, yb, a[xa][yb] == a[(xa+1)%n][yb]);
    }
    else if(ya == yb) {
      rot(xa, (ya+1)%n, xb, yb, a[xa][(ya+1)%n] == a[xb][yb]);
    }
    else assert(false);
    swap(a[xa][ya], a[xb][yb]);
  }
  assert(sz(ops) <= n*n*n);
  cout << sz(ops) << "\n";
  for(auto [aa, bb]: ops) cout << aa << " " << bb << "\n";
}

// what would chika do
// are there edge cases?
// did you actually sort the thing instead of just thinking it?
// integer overflow?

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  solve();
}