#include <bits/stdc++.h>
using namespace std;
#define int long long
mt19937_64 rng(std::chrono::system_clock::now().time_since_epoch().count());

vector<int>vals(20000);
map<int,pair<int,int>>hm;
    map<pair<int,int>,int>mk;
deque<int> solve(string s){
    deque<int>dq;
    
    for(int i = 0; i<20000; i++){
        dq.push_back(vals[i]);
    }
    for(char ch: s){
        if(ch=='C'){
            dq.push_front(dq.front());
        }
        if(ch=='D'){
            dq.pop_front();
        }
        if(ch=='L'){
            int v = dq.front();
            if(hm.count(v)){
                int l = hm[v].first;
                dq.pop_front();
                dq.push_front(l);
            }
            else{
                dq.clear();
                return dq;
            }
        }
        if(ch=='R'){
            int v = dq.front();
            if(hm.count(v)){
                int r = hm[v].second;
                dq.pop_front();
                dq.push_front(r);
            }
            else{
                dq.clear();
                return dq;
            }
        }
        if(ch=='S'){
            int v = dq.front();
            dq.pop_front();
            int v2 = dq.front();
            dq.pop_front();
            dq.push_front(v);
            dq.push_front(v2);
        }
        if(ch=='P'){
            int v = dq.front();
            dq.pop_front();
            int v2 = dq.front();
            dq.pop_front();
            if(!mk.count({v,v2})){
                int r = rng();
                hm[r] = {v,v2};
                mk[{v,v2}] = r;
            }
            dq.push_front(mk[{v,v2}]);
        }
        if(ch=='U'){
            int v = dq.front();
            dq.pop_front();
            if(hm.count(v)){
                auto [l,r] = hm[v];
                dq.push_front(r);
                dq.push_front(l);
            }
            else{
                dq.clear();
                return dq;
            }
        }
    }
    return dq;
}
signed main(){
    cin.tie(nullptr)->sync_with_stdio(false);
    string s,t;
    cin >> s >> t;
    for(int i = 0; i<20000; i++){
        vals[i] = rng();
    }
    auto r = solve(s);
    auto r2 = solve(t);
    /*
    cout << r.size() << ' ' << r2.size() << '\n';
    
    cout << vals[0] << ' ' << vals[1] << '\n';
    cout << r[0] << ' ' << r[1] << '\n';
    cout << r2[0] << ' ' << r2[1] << '\n';
    */
    if(r==r2)cout << "True\n";
    else cout << "False\n";

    return 0;
}