#include <bits/stdc++.h>
using namespace std;
#define V vector
#define all0(x) (x).begin(),(x).end()
#define all1(x) (x).begin()+1,(x).end()
#define pb push_back
typedef long long ll;

//const int MN = 3e5 + 20;//MaxN 记得改一下
mt19937 mrand(chrono::steady_clock().now().time_since_epoch().count());
//模板区域~~~~~~~

//模板结束~~~~~~~
const int N=500;
int pre[N][N],tg[N][N];
int n;
vector<vector<int>>ans;
void U(pair<int,int>a,pair<int,int>b){
    int cnt=(b.first-a.first+n)%n;
    cnt=(n-cnt)%n;
    for(int i=0;i<cnt;i++)ans.push_back({2,a.second});
}
void D(pair<int,int>a,pair<int,int>b){
    int cnt=(b.first-a.first+n)%n;
    // cnt=(n-cnt)%n;
    for(int i=0;i<cnt;i++)ans.push_back({2,a.second});
}
void L(pair<int,int>a,pair<int,int>b){
    int cnt=(b.second-a.second+n)%n;
    cnt=(n-cnt)%n;
    for(int i=0;i<cnt;i++)ans.push_back({1,a.first});
}
void R(pair<int,int>a,pair<int,int>b){
    int cnt=(b.second-a.second+n)%n;
    // cnt=(n-cnt)%n;
    for(int i=0;i<cnt;i++)ans.push_back({1,a.first});
}
void swap3(pair<int,int>a,pair<int,int>b,pair<int,int>c,int type){
    assert(a.first==b.first);
    assert(a.second==c.second);
    assert(a!=b&&a!=c&&b!=c);
    if(type==1){
        U(a,c);
        L(a,b);
        D(a,c);
        R(a,b);
    }
    else{
        L(a,b);
        U(a,c);
        R(a,b);
        D(a,c);
    }
}

int getnum(pair<int,int>a){
    ll x=a.first,y=a.second;
    // while(x<=0)x+=n;
    // while(x>n)x-=n;
    // while(y<=0)y+=n;
    // while(y>n)y-=n;
    return pre[x][y];
}
void doswap(pair<int,int>a,pair<int,int>b){
    if(a.first!=b.first&&a.second!=b.second){
        pair<int,int> c={a.first,b.second};
        if(getnum(a)==getnum(c)){
            swap3(c,a,b,2);
        }
        else{
            swap3(c,a,b,1);
        }
   }
   else if(a.first==b.first)
    {
        pair<int,int>c={a.first%n+1,a.second};
        if(getnum(a)==getnum(c)){
            swap3(a,b,c,2);
        }
        else{
            swap3(a,b,c,1);
        }
    }
    else if(a.second==b.second){
        pair<int,int>c={a.first,(a.second)%n+1};
        if(getnum(a)==getnum(c)){
            swap3(a,c,b,1);
        }
        else{
            swap3(a,c,b,2);
        }
    }
    swap(pre[a.first][a.second],pre[b.first][b.second]);
}
void output(){
    cout<<ans.size()<<'\n';
    assert(ans.size()<=n*n*n);
    for(int i=0;i<ans.size();i++){
        cout<<ans[i][0]<<' '<<ans[i][1]<<'\n';
    }
    cout<<'\n';
    for(int i=1;i<=n;i++){
        for(int j=1;j<=n;j++){
            assert(pre[i][j]==tg[i][j]);
        }
    }
}
void solve() {
    // int n;
    cin>>n;
    for(int i=1;i<=n;i++){
        string s;
        cin>>s;
        for(int j=1;j<=n;j++){
            if(s[j-1]=='#'){
                pre[i][j]=1;
            }
            else{
                pre[i][j]=0;
            }
        }
    }
    for(int i=1;i<=n;i++){
        string s;
        cin>>s;
        for(int j=1;j<=n;j++){
            if(s[j-1]=='#'){
                tg[i][j]=1;
            }
            else{
                tg[i][j]=0;
            }
        }
    
    }
    vector<pair<int,int>>nd10,nd01;
    for(int i=1;i<=n;i++){
        for(int j=1;j<=n;j++){
            if(pre[i][j]==1&&tg[i][j]==0){
                nd10.push_back({i,j});
            }
            else if(pre[i][j]==0&&tg[i][j]==1){
                nd01.push_back({i,j});
            }
        }
    }
    if(nd10.size()!=nd01.size()){
        cout<<"No\n";
        return ;
    }
    cout<<"Yes\n";
    
    for(int i=0;i<nd10.size();i++){
        doswap(nd10[i],nd01[i]);
    }
    output();
}

int32_t main() {
    ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
    int tt=1;
    //cin >> tt;
    for(int t=0;t<tt;t++)
    solve();
}