rt

#include<bits/stdc++.h>
#define int long long
using namespace std;
const int N=505;
string s,s1;
int n,m,dp[N][N];
signed main()
{
	cin>>n;
	while(n--)
	{
		cin>>s>>s1;
		memset(dp,0,sizeof(dp));
		for(int i=1;i<=s.size();i++)
		{
			for(int j=1;j<=s1.size();j++)
			{
				dp[i][j]=max(dp[i-1][j],dp[i][j-1]);
				if(s[i-1]==s1[j-1]) dp[i][j]=dp[i-1][j-1]+1;
			}
		}
		dp[s.size()][s1.size()]>=max(s.size()-1,s1.size()-1)?cout<<"similar\n":cout<<"not similar\n";		
	}
}