#include<bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include <debug.hpp>
#define debug(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__)
#else
#define debug(...) (static_cast<void>(0))
#endif
//#pragma GCC target("avx,avx2")
//#pragma GCC optimize("O3")
//#pragma GCC optimize("unroll-loops")
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pll = pair<ll,ll>;
using pii = pair<int,int>;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vvvl = vector<vvl>;
using vul = vector<ull>;
using vpii = vector<pii>;
using vvpii = vector<vpii>;
using vpll = vector<pll>;
using vvpll = vector<vpll>;
using vs = vector<string>;
template<class T> using pq = priority_queue<T,vector<T>, greater<T>>;
#define overload4(_1, _2, _3, _4, name, ...) name
#define overload3(a,b,c,name,...) name
#define rep1(n) for (ll UNUSED_NUMBER = 0; UNUSED_NUMBER < (n); ++UNUSED_NUMBER)
#define rep2(i, n) for (ll i = 0; i < (n); ++i)
#define rep3(i, a, b) for (ll i = (a); i < (b); ++i)
#define rep4(i, a, b, c) for (ll i = (a); i < (b); i += (c))
#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)
#define rrep1(n) for(ll i = (n) - 1;i >= 0;i--)
#define rrep2(i,n) for(ll i = (n) - 1;i >= 0;i--)
#define rrep3(i,a,b) for(ll i = (b) - 1;i >= (a);i--)
#define rrep4(i,a,b,c) for(ll i = (a) + (((b)-(a)-1) / (c) - (((b)-(a)-1) % (c) && (((b)-(a)-1) ^ c) < 0)) * (c);i >= (a);i -= c)
#define rrep(...) overload4(__VA_ARGS__, rrep4, rrep3, rrep2, rrep1)(__VA_ARGS__)
#define all1(i) begin(i) , end(i)
#define all2(i,a) begin(i) , begin(i) + a
#define all3(i,a,b) begin(i) + a , begin(i) + b
#define all(...) overload3(__VA_ARGS__, all3, all2, all1)(__VA_ARGS__)
#define sum(...) accumulate(all(__VA_ARGS__),0LL)
template<class T> bool chmin(T &a, const T &b){ if(a > b){ a = b; return 1; } else return 0; }
template<class T> bool chmax(T &a, const T &b){ if(a < b){ a = b; return 1; } else return 0; }
template<class T> auto min(const T& a){return *min_element(all(a));}
template<class T> auto max(const T& a){return *max_element(all(a));}
template<class... Ts> void in(Ts&... t);
#define INT(...) int __VA_ARGS__; in(__VA_ARGS__)
#define LL(...) ll __VA_ARGS__; in(__VA_ARGS__)
#define STR(...) string __VA_ARGS__; in(__VA_ARGS__)
#define CHR(...) char __VA_ARGS__; in(__VA_ARGS__)
#define DBL(...) double __VA_ARGS__; in(__VA_ARGS__)
#define LD(...) ld __VA_ARGS__; in(__VA_ARGS__)
#define VEC(type, name, size) vector<type> name(size); in(name)
#define VV(type, name, h, w) vector<vector<type>> name(h, vector<type>(w)); in(name)
ll intpow(ll a, ll b){ll ans = 1; while(b){if(b & 1) ans *= a; a *= a; b /= 2;} return ans;}
ll modpow(ll a, ll b, ll p){ ll ans = 1 % p; a %= p;if(a < 0) a += p;while(b){ if(b & 1) (ans *= a) %= p; (a *= a) %= p; b /= 2; } return ans; }
bool is_clamp(ll val,ll low,ll high) {return low <= val && val < high;}
void Yes() {cout << "Yes\n";return;}
void No() {cout << "No\n";return;}
void YES() {cout << "YES\n";return;}
void NO() {cout << "NO\n";return;}
template <typename U,typename T>
U floor(U a, T b) {return a / b - (a % b && (a ^ b) < 0);}
// ceil(x,y) = floor(x+y-1,y)なのでx+y-1がoverflowする可能性あり
template <typename U,typename T>
U ceil(U x, T y) {return floor(x + y - 1, y);}
template <typename U,typename T>
T bmod(U x, T y) {return x - y * floor(x, y);}
template <typename U,typename T>
pair<U, T> divmod(U x, T y) {U q = floor(x, y);return {q, x - q * y};}
namespace IO{
#define VOID(a) decltype(void(a))
struct setting{ setting(){cin.tie(nullptr); ios::sync_with_stdio(false);fixed(cout); cout.precision(15);}} setting;
template<int I> struct P : P<I-1>{};
template<> struct P<0>{};
template<class T> void i(T& t){ i(t, P<3>{}); }
void i(vector<bool>::reference t, P<3>){ int a; i(a); t = a; }
template<class T> auto i(T& t, P<2>) -> VOID(cin >> t){ cin >> t; }
template<class T> auto i(T& t, P<1>) -> VOID(begin(t)){ for(auto&& x : t) i(x); }
template<class T, size_t... idx> void ituple(T& t, index_sequence<idx...>){in(get<idx>(t)...);}
template<class T> auto i(T& t, P<0>) -> VOID(tuple_size<T>{}){ituple(t, make_index_sequence<tuple_size<T>::value>{});} 
#undef VOID
}
#define unpack(a) (void)initializer_list<int>{(a, 0)...}
template<class... Ts> void in(Ts&... t){ unpack(IO :: i(t)); }
#undef unpack
constexpr long double PI = 3.141592653589793238462643383279L;
template <class F> struct REC {
    F f;
    REC(F &&f_) : f(forward<F>(f_)) {}
    template <class... Args> auto operator()(Args &&...args) const { return f(*this, forward<Args>(args)...); }};

constexpr int mod = 998244353;
//constexpr int mod = 1000000007;


void solve() {
    VEC(string,s,2);
    int n = s[0].size();
    vvi cnt(2,vi(3));
    rep(i,2) {
        rep(j,3) {
            if(s[i][j] == 'g') cnt[i][0]++;
            else if(s[i][j] == 'o') cnt[i][1]++;
            else cnt[i][2]++;
        }
    }
    if(cnt[0] != cnt[1]) {
        No();
        return;
    }
    if(cnt[0][0] == 0 || cnt[0][1] <= 2 || cnt[0][2] == 0) {
        Yes();
        return;
    }
    vi gr(2);
    rep(i,2) {
        int rg = 0,ld = n;
        rep(j,n) {
            if(s[i][j] == 'g') {
                rg = j;
            }
            if(s[i][j] == 'd') {
                if(ld == n) ld = j;
            }
        }
        if(rg <= ld + 4) {
            gr[i] = 1;
        }
    } 
    if(gr[0] != gr[1]) {
        No();
    }
    else {
        Yes();
    }
    //INT(g,o,d);
    // int n = g + o + d;
    // string v;
    // rep(i,d) v += 'd';
    // rep(i,g) v += 'g';
    // rep(i,o) v += 'o';
    // map<string,int> mp;
    // int id = 0;
    // vs S;
    // do {
    //     int ok = 1;
    //     rep(j,n-3) {
    //         if(v.substr(j,4) == "good") {
    //             ok = 0;
    //             break;
    //         } 
    //     }
    //     if(ok) {
    //         mp[v] = id++;
    //         S.emplace_back(v);
    //     }
    // }while(next_permutation(all(v)));
    // unionfind uf(id); 
    // for(auto [s,idx]:mp) {
    //     string tmp = s;
    //     rep(j,n-1) {
    //         swap(tmp[j],tmp[j+1]);
    //         if(mp.contains(tmp)) {
    //             uf.merge(idx,mp[tmp]);
    //         }
    //         swap(tmp[j],tmp[j+1]);
    //     }
    // }
    // auto gs = uf.groups();
    // map<vi,vector<vs>> MP;
    // sort(all(gs),[](auto &x,auto &y){return x.size() < y.size();});
    // rep(i,1) {
    //     vs gr(gs[i].size());
    //     rep(j,gs[i].size()) {
    //         gr[j] = S[gs[i][j]];
    //     }
    //     vi cnt(3);
    //     rep(j,n) {
    //         if(gr[0][j] == 'g') cnt[0]++;
    //         else if(gr[0][j] == 'o') cnt[1]++;
    //         else cnt[2]++;
    //     }
    //     MP[cnt].emplace_back(gr);
    // }
    // debug(gs.size());
    // for(auto &[v,SS]:MP) {
    //     debug(v,SS);
    // }
}
int main() {
    INT(TT);
    //int TT = 1;
    rep(i,TT) solve();
}