#include<bits/stdc++.h>
using namespace std;

#define int long long
typedef pair<int,int>pint;
typedef vector<int>vint;
typedef vector<pint>vpint;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define all(v) (v).begin(),(v).end()
#define rep(i,n) for(int i=0;i<(n);i++)
#define reps(i,f,n) for(int i=(f);i<(n);i++)
#define each(it,v) for(__typeof((v).begin()) it=(v).begin();it!=(v).end();it++)
template<class T,class U>inline void chmin(T &t,U f){if(t>f)t=f;}
template<class T,class U>inline void chmax(T &t,U f){if(t<f)t=f;}

string X;

signed main(){
    string S,T;
    cin>>S>>T;
    X=S;

    rep(i,2){
        int a=0,b=0;
        bool ok=true;
        rep(j,X.size()){
            if(j%2==0){
                while(a<S.size()&&S[a]!=X[j])a++;
                if(a>=S.size())ok=false;
                a++;
            }
            else{
                while(b<T.size()&&T[b]!=X[j])b++;
                if(b>=T.size())ok=false;
                b++;
            }
        }
        if(ok){
            cout<<"Yes"<<endl;
            return 0;
        }
        swap(S,T);
    }
    cout<<"No"<<endl;
    return 0;
}
### Prompt

In CPP, your task is to solve the following problem:

Example

Input

acmicpc
tsukuba


Output

No

### Response

```cpp
#include<bits/stdc++.h>
using namespace std;

#define int long long
typedef pair<int,int>pint;
typedef vector<int>vint;
typedef vector<pint>vpint;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define all(v) (v).begin(),(v).end()
#define rep(i,n) for(int i=0;i<(n);i++)
#define reps(i,f,n) for(int i=(f);i<(n);i++)
#define each(it,v) for(__typeof((v).begin()) it=(v).begin();it!=(v).end();it++)
template<class T,class U>inline void chmin(T &t,U f){if(t>f)t=f;}
template<class T,class U>inline void chmax(T &t,U f){if(t<f)t=f;}

string X;

signed main(){
    string S,T;
    cin>>S>>T;
    X=S;

    rep(i,2){
        int a=0,b=0;
        bool ok=true;
        rep(j,X.size()){
            if(j%2==0){
                while(a<S.size()&&S[a]!=X[j])a++;
                if(a>=S.size())ok=false;
                a++;
            }
            else{
                while(b<T.size()&&T[b]!=X[j])b++;
                if(b>=T.size())ok=false;
                b++;
            }
        }
        if(ok){
            cout<<"Yes"<<endl;
            return 0;
        }
        swap(S,T);
    }
    cout<<"No"<<endl;
    return 0;
}
```