#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define fi first
#define se second
#define ll long long
#define ld long double
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define mpp make_pair
#define ve vector
using namespace std;
using namespace __gnu_pbds;
template<class T> using oset = tree<T,null_type,less<T>,rb_tree_tag,tree_order_statistics_node_update>;
const ll inf = 1e18; const int iinf = 1e9;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
template <typename T> inline bool chmin(T& a, T b) { return (a > b ? a = b, 1 : 0); }
template <typename T> inline bool chmax(T& a, T b) { return (a < b ? a = b, 1 : 0); }
inline ve<int> get(string &s) { s += '+';
ve<int> cnt(26);
while (sz(s) > 0) {
int p = s.find('+');
string cur = s.substr(0, p);
s.erase(0, p + 1);
int coef = 1;
if (isdigit(cur[0])) {
coef = cur[0] - '0';
cur.erase(0, 1);
}
for (int i = 0; i < sz(cur); ++i) {
if (isdigit(cur[i])) continue;
int c = (i == sz(cur) - 1 || !isdigit(cur[i + 1]) ? 1 : cur[i + 1] - '0');
cnt[cur[i] - 'A'] += c * coef;
}
}
return cnt;
}
inline void solve() {
string s; cin >> s;
int pos = s.find('-');
string left = s.substr(0, pos);
string right = s.substr(pos + 2, sz(s) - pos - 2);
auto a = get(left);
auto b = get(right);
cout << (a == b ? "DA" : "NE") << '\n';
}
signed main() {
ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
int q = 1; cin >> q;
while (q--) solve();
cerr << fixed << setprecision(3) << "Time execution: " << (double)clock() / CLOCKS_PER_SEC << endl;
}
