#include <iostream>
#include <algorithm>
#include <cstring>
#include <vector>
using namespace std;
int n;
string dfs(string &s, int &u) {
u ++;
vector<string> seqs;
while (s[u] == '0') seqs.push_back(dfs(s, u));
u ++;
sort(seqs.begin(), seqs.end());
string res = "0";
for (auto x : seqs) {
res += x;
}
res += '1';
return res;
}
int main() {
cin >> n;
while (n --) {
string sa, sb;
int ua = 0, ub = 0;
cin >> sa >> sb;
sa = '0' + sa + '1';
sb = '0' + sb + '1';
if (dfs(sa, ua) == dfs(sb, ub)) puts("same");
else puts("different");
}
return 0;
}