rt ,
#include <iostream>
#include <cmath>
using namespace std;
const int N=1e6+1000;
int n;
signed main(){
cin>>n;
while(n--){
string a,b;
cin>>a>>b;
int l1=a.length(),l2=b.length();
if (abs(l1-l2)>1){
cout<<"not similar"<<endl;
continue;
}
else{
if (l1==l2){
int different=0;
for (int i=0;i<l1;i++){
if (a[i]!=b[i]){
different++;
}
}
if (different>1){
cout<<"not similar"<<endl;
}
else{
cout<<"similar"<<endl;
continue;
}
}
else{
int d=0;
for (int i=0;i<max(l1,l2);i++){
if (a[i]!=b[i]){
for (int j=i+1;j<max(l1,l2);j++){
if (a[j]!=b[j] && (a[j]>='a' && a[j]<='z') && (b[j]>='a' && b[j]<='z')){
cout<<"not similar"<<endl;
break;d=1;
}
}
break;
}
}
if (d!=1){
cout<<"similar"<<endl;
continue;
}
}
}
}
return 0;
}