#include<bits/stdc++.h>
using namespace std;
string dfs(string s, int &u)
{
    u++;
    vector<string> v;
    while(s[u] == '0') v.push_back(dfs(s, u));
    u++;
    sort(v.begin(), v.end());
    string ans;
    for(string i : v) ans += i;
    ans = '0' + ans + '1';
    return ans;
}
int main()
{
    int T;
    scanf("%d", &T);
    while(T--)
    {
        string s1, s2;
        cin >> s1 >> s2;
        s1 = '0' + s1 + '1';
        s2 = '0' + s2 + '1';
        int u1 = 0, u2 = 0;
        if(dfs(s1, u1) == dfs(s2, u2)) puts("same");
        else puts("different");
    }
    return 0;
}

#include<bits/stdc++.h>
using namespace std;
string dfs(string s,int &u)
{
    u++;
    vector<string> v;
    while(s[ u ]=='0') v.push_back(dfs(s,u));
    u++;
    sort(v.begin(),v.end());
    string ans;
    for(string i:v) ans+=i;
    ans='0'+ans+'1';
    return ans;
}
int main()
{
    int T;
    scanf("%d",&T);
    while(T--)
    {
        string s1,s2;
        cin>>s1>>s2;
        s1='0'+s1+'1',s2='0'+s2+'1';
        int u1=0,u2=0;
        if(dfs(s1,u1)==dfs(s2,u2)) puts("same");
        else puts("different");
    }
    return 0;
}