#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rep1(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < (t); ++i)
#define rng(a) a.begin(),a.end()
#define rrng(a) a.rbegin(),a.rend()
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define em emplace
#define pob pop_back
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcountll
#define snuke srand((unsigned)clock()+(unsigned)time(NULL));
#define newline puts("")
#define vc vector
using namespace std;
template<class T> using vv = vc<vc<T>>;
template<class T> using PQ = priority_queue<T,vc<T>,greater<T>>;
using uint = unsigned; using ull = unsigned long long;
using vi = vc<int>; using vvi = vv<int>; using vvvi = vv<vi>;
using ll = long long; using vl = vc<ll>; using vvl = vv<ll>; using vvvl = vv<vl>;
using P = pair<int,int>; using vp = vc<P>; using vvp = vv<P>; using LP = pair<ll,ll>;
int geti(){int x;scanf("%d",&x);return x;}
vi pm(int n, int s=0) { vi a(n); iota(rng(a),s); return a;}
template<class T1,class T2>istream& operator>>(istream&i,pair<T1,T2>&v){return i>>v.fi>>v.se;}
template<class T1,class T2>ostream& operator<<(ostream&o,const pair<T1,T2>&v){return o<<v.fi<<","<<v.se;}
template<class T>istream& operator>>(istream&i,vc<T>&v){rep(j,sz(v))i>>v[j];return i;}
template<class T>string join(const T&v,const string&d=""){stringstream s;rep(i,sz(v))(i?s<<d:s)<<v[i];return s.str();}
template<class T>ostream& operator<<(ostream&o,const vc<T>&v){if(sz(v))o<<join(v," ");return o;}
template<class T>void vin(vc<T>&a){int n;cin>>n;a=vc<T>(n);cin>>a;}
template<class T>void vin(vv<T>&a){int n,m;cin>>n>>m;a=vv<T>(n,vc<T>(m));cin>>a;}
template<class T1,class T2>void operator--(pair<T1,T2>&a,int){a.fi--;a.se--;}
template<class T1,class T2>void operator++(pair<T1,T2>&a,int){a.fi++;a.se++;}
template<class T>void operator--(vc<T>&a,int){for(T&x:a)x--;}
template<class T>void operator++(vc<T>&a,int){for(T&x:a)x++;}
template<class T1,class T2>void operator+=(vc<T1>&a,T2 b){for(T1&x:a)x+=b;}
template<class T1,class T2>void operator-=(vc<T1>&a,T2 b){for(T1&x:a)x-=b;}
template<class T1,class T2>void operator*=(vc<T1>&a,T2 b){for(T1&x:a)x*=b;}
template<class T1,class T2>void operator/=(vc<T1>&a,T2 b){for(T1&x:a)x/=b;}
template<class T>void operator+=(vc<T>&a,const vc<T>&b){a.insert(a.end(),rng(b));}
template<class T1,class T2>pair<T1,T2>operator+(const pair<T1,T2>&a,const pair<T1,T2>&b){return {a.fi+b.fi,a.se+b.se};}
template<class T1,class T2>pair<T1,T2>operator-(const pair<T1,T2>&a,const pair<T1,T2>&b){return {a.fi-b.fi,a.se-b.se};}
template<class T>pair<T,T>operator*(const pair<T,T>&a,T b){return {a.fi*b,a.se*b};}
template<class T1,class T2>bool mins(T1& x,const T2&y){if(y<x){x=y;return true;}else return false;}
template<class T1,class T2>bool maxs(T1& x,const T2&y){if(x<y){x=y;return true;}else return false;}
template<class T>T min(const vc<T>&a){return *min_element(rng(a));}
template<class T>T max(const vc<T>&a){return *max_element(rng(a));}
template<class Tx,class Ty>Tx dup(Tx x, Ty y){return (x+y-1)/y;}
template<class T>ll suma(const vc<T>&a){ll s=0;for(auto&&x:a)s+=x;return s;}
template<class T>ll suma(const vv<T>&a){ll s=0;for(auto&&x:a)s+=suma(x);return s;}
template<class T>void uni(T&a){sort(rng(a));a.erase(unique(rng(a)),a.end());}
template<class T>void prepend(vc<T>&a,const T&x){a.insert(a.begin(),x);}
const double eps = 1e-10;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
#define dame { puts("-1"); return;}
#define yes { puts("Yes");}
#define no { puts("No"); return;}
#define rtn(x) { cout<<(x)<<'\n'; return;} // flush!
#define yn {puts("Yes");}else{puts("No");}
using vs = vc<string>;
void vin(vs& s){int n,m;cin>>n>>m;s=vs(n);cin>>s;}
template<typename T>void rot(T& a,int i){rotate(a.begin(),a.begin()+(i),a.end());}
template<typename T>void rot(vv<T>& a){int h=sz(a),w=sz(a[0]);vv<T> p(w,vc<T>(h));swap(a,p);rep(i,h)rep(j,w)a[j][h-1-i]=p[i][j];}
void rot(vc<string>& a){int h=sz(a),w=sz(a[0]);vc<string> p(w,string(h,'?'));swap(a,p);rep(i,h)rep(j,w)a[j][h-1-i]=p[i][j];}


struct Solver {
  int countx(vs& s) {
    int n = sz(s);
    int res = 0;
    rep(i,n)rep(j,n) res += s[i][j] == '#';
    return res;
  }

  vp calc(vs s, bool fli=false) {
    int n = sz(s);
    int m = countx(s);

    int n1 = n-1;
    int up = m/n1, rem = m%n1;
    vp res;

    // cout<<fli<<" "<<up<<" "<<rem<<endl;
    // cout<<s<<endl;

    auto row = [&](int i) {
      if (fli) rot(s[i],1);
      else rot(s[i],n1);
      res.eb(1,i+1);

      // rep(i,n) cout<<s[i]<<endl; cout << endl;
      // cout<<res<<endl;
    };
    auto col = [&](int j) {
      if (fli) {
        rep(i,n1) swap(s[i][j],s[i+1][j]);
      } else {
        drep(i,n1) swap(s[i][j],s[i+1][j]);
      }
      res.eb(2,j+1);

      // rep(i,n) cout<<s[i]<<endl; cout << endl;
      // cout<<res<<endl;
    };

    while (1) {
      rep(i,n) {
        char ca = '.', cb = '#';
        if (i < up) swap(ca,cb);
        rep(j,n1) if (s[i][n1] == ca && s[i][j] == cb) {
          row(i);
        }
      }

      bool ok = true;
      rep(i,n) {
        char c = (i<up)?'#':'.';
        rep(j,n1) if (s[i][j] != c) ok = false;
      }
      if (ok) break;

      col(n1);
    }

    if (rem) {
      if (fli) {
        while (s[up][n1-rem] == '.') {
          while (s[up][n1] == '.') {
            col(n1);
          }
          row(up);
        }
        rep(i,n1-rem) row(up);
      } else {
        while (s[up][rem-1] == '.') {
          while (s[up][n1] == '.') {
            col(n1);
          }
          row(up);
        }
      }
    }

    return res;
  }
  void solve() {
    int n;
    cin>>n;
    vs s(n), t(n);
    cin>>s>>t;

    int m = countx(s);
    if (m != countx(t)) no;

    if (m*2 > n*n) {
      rep(i,n)rep(j,n) s[i][j] ^= '#'^'.';
      rep(i,n)rep(j,n) t[i][j] ^= '#'^'.';
    }

    vp ans = calc(s);
    vp ans2 = calc(t,true);
    reverse(rng(ans2));
    ans.insert(ans.end(), rng(ans2));

    assert(sz(ans) <= n*n*n);
    if (0) {
      for (auto [type,x] : ans) {
        if (type == 1) {
          rot(s[x-1],n-1);
        } else {
          drep(i,n-1) swap(s[i][x-1],s[i+1][x-1]);
        }

        // cerr<<type<<" "<<x<<endl;
        // rep(i,n) cerr<<s[i]<<endl;
      }
      assert(s == t);
      yes;
      return;
    }

    yes;
    printf("%d\n",sz(ans));
    for (auto& p: ans) {
      printf("%d %d\n",p.fi,p.se);
    }
  }
};

int main() {
  // cin.tie(nullptr); ios::sync_with_stdio(false);
  int ts = 1;
  // scanf("%d",&ts);
  rep1(ti,ts) {
    Solver solver;
    solver.solve();
  }
  return 0;
}