#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
typedef unsigned long long llu;
const int N=3005;
const llu P=13;
int Tc,n;
int p;
char s1[N],s2[N];

llu dfs(char *s){
	vector <int> Q;
	Q.clear();
	while (1){
		if (s[p]=='0'){
		  p++;
		  Q.push_back(dfs(s));
		}
		else if (p==n || s[p]=='1'){
		  p++;
		  sort(Q.begin(),Q.end());
		  llu ret=1;
		  for (int i=0;i<Q.size();i++)
		  	ret=(ret*P)^Q[i];
		  return ret;
		}
	}
}

int main(){
	scanf("%d",&Tc);
	while (Tc--){
		scanf("%s%s",s1,s2);
		n=strlen(s1);
		p=0;
		llu hash1=dfs(s1);
		p=0;
		llu hash2=dfs(s2);
		if (hash1==hash2) puts("same");
		             else puts("different");
	}
}