#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 5;
typedef long long ll;
typedef long double ld;
#define sz(x) ((int)x.size())
typedef pair<int,int> pii;

#define _ << " " <<
struct Node {
    vector<int> c;
    vector<pii> sh;
};
int tot;
Node t[maxn];

struct SN {
    string op="";
    deque<int> v;
    int siz=0;
};
SN zero;

SN parse(string &x) {
    list<SN> st; 

    auto parseList = [&]() {
        stringstream ss(st.back().op);
        char c; int x; ss >> c;
        st.back().v.push_back(0);
        while (!ss.eof()) {
            ss >> x;
            st.back().v.push_back(x);
            st.back().siz++;
            ss >> c;
        }
    };

    auto parseOp = [&]() {
        string name;
        auto it = --st.end();
        auto it2 = it; --it2;
        auto it3 = it2;
        if (it2->op[0] == '[') {
            --it3;
            name = it3->op;
        } else name = it2->op;

        if (name == "concat") {
            // it2, it1
            if (it2->v.size() < it->v.size()) {
                while (!it2->v.empty()) {
                    it->v.push_front(it2->v.back());
                    it2->v.pop_back();
                }
                it->siz += it2->siz;
                st.erase(it2);
            } else {
                while (!it->v.empty()) {
                    it2->v.push_back(it->v.front());
                    it->v.pop_front();
                }
                it2->siz += it->siz;
                st.erase(it);
            }
            st.erase(--(--st.end()));
        } else if (name == "shuffle") {
            st.erase(it2);
            st.back().v.front() = -st.back().siz;
        } else if (name == "sorted") {
            st.erase(it2);
            st.back().v.front() = INT_MAX - st.back().siz;
        }
    };

    st.push_back(zero);        
    int open = 0;
    for (int i = 0;i < sz(x); ++i) {
        
        if (x[i] == ']') {
            parseList();
            open = 0;
        } else if (x[i] == ')') {
            parseOp();
        } else if (x[i] == '('){
            st.push_back(zero);
        } else if (x[i] == '['){
            st.back().op.push_back(x[i]);
            open = 1;
        } else if (x[i] == ',' && !open) {
            st.push_back(zero);
        } else {
            st.back().op += x[i];
        }
    }
    // for (auto x : st.back().v) cout << x << endl;
    return st.back();
}




bool cmp(SN a, SN b) {
    auto gen = [&](SN &a,vector<pii> &sha, vector<int> &ans) {
        
        int i = 0;
        for (;i < sz(a.v); ++i) {
            int x = a.v[i];
            if (x < 0) {
                int siz = -x;
                int pre = -1; int ok = 1;
                for (int j = 0;j < siz; ++i) {
                    if (a.v[i] > 0 && a.v[i] <= 1e9) {
                        ans.push_back(a.v[i]);
                        j++;
                        if (pre == -1) pre = a.v[i];
                        else if (pre != a.v[i]) ok = 0;
                    }
                }
                if (!ok) {
                    sort(ans.end()-siz,ans.end());
                    sha.push_back({sz(ans)-siz, ans.size()});
                }
            } else if (x > 1e9) {
                int siz = INT_MAX - x;
                for (int j = 0;j < siz; ++i) {
                    if (a.v[i] > 0 && a.v[i] <= 1e9) {
                        ans.push_back(a.v[i]);
                        j++;
                    }
                }
                sort(ans.end()-siz, ans.end());
            } else if (x > 0){
                ans.push_back(x);
            }
        }
    };
    vector<pii> sa, sb;
    vector<int> ansa, ansb;
    gen(a,sa, ansa);
    gen(b,sb, ansb);
    sort(sa.begin(), sa.end());
    sort(sb.begin(),sb.end());
    return sa == sb && ansa == ansb;
}

int main() {
    #ifdef LLOCAL
    freopen("a.in", "r", stdin);
    #endif
    ios_base::sync_with_stdio(0); cin.tie(0);
    string a, b; cin >> a >> b;
    auto ta = parse(a);
    auto tb = parse(b);
    if (cmp(ta,tb)) {
        cout <<"equal" << '\n';
    } else {
        cout << "not equal" << '\n';
    }
    return 0;
}