https://vjudge.net/problem/CodeForces-1243B1
#include <bits/stdc++.h>
//#include <queue>
//#include <cmath>
//#include <iostream>
//#include <unordered_map>
#define lson rt<<1
#define rson rt<<1|1
#define lowbit(x) ((x)&(-x))
#define mem(x,y) memset(x,y,sizeof(x))
#define pb push_back
#define INF 0x3f3f3f3f
#define ll long long
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;
const int mod=1e9+7;
const int N=1e5+9;
int main()
{
FAST_IO;
int T;
cin>>T;
while(T--)
{
string s,t;
int n;
cin>>n;
cin>>s>>t;
vector<int >pos;
for(int i=0;i<n;i++){
if(s[i]!=t[i]) pos.pb(i);
}
if(pos.size()==0) cout<<"YES"<<endl;
else if(pos.size()==1)
{
cout<<"NO"<<endl;
}
else if(pos.size()>2) cout<<"NO"<<endl;
else
{
int p=pos[0];
int pp=pos[1];
// cout<<p<<" "<<pp<<endl;
swap(s[p],t[pp]);
if(s==t) cout<<"YES"<<endl;
else
{
swap(s[p],t[pp]);
swap(s[pp],t[p]);
if(s==t) cout<<"YES"<<endl;
else cout<<"NO"<<endl;
}
}
}
return 0;
}