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

int main() {
    string s,t;
    cin>>s>>t;
    bool canmake=true;
    //sから始める
    int it=-1;
    for (int i = 1; i < s.size(); i+=2) {
        bool f=false;
        for (int j = 0; j < t.size(); ++j) {
            if(t[j]==s[i]&&j>=(i-1)/2&&j>it){
                f=true;
                it=j;
                break;
            }
        }
        canmake=f;
        if(!canmake)break;
    }
    if(canmake){
        cout<<"Yes"<<endl;
        return 0;
    }
    //ｔから始める
    it=-1;
    for (int i = 0; i < s.size(); i+=2) {
        bool f=false;
        for (int j = 0; j < t.size(); ++j) {
            if(t[j]==s[i]&&j>=i/2&&j>it){
                f=true;
                it=j;
                break;
            }
        }
        canmake=f;
        if(!canmake)break;
    }
    if(canmake)cout<<"Yes"<<endl;
    else cout<<"No"<<endl;
    return 0;
}

### Prompt

Your challenge is to write a Cpp solution to the following problem:

Example

Input

acmicpc
tsukuba


Output

No

### Response

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

int main() {
    string s,t;
    cin>>s>>t;
    bool canmake=true;
    //sから始める
    int it=-1;
    for (int i = 1; i < s.size(); i+=2) {
        bool f=false;
        for (int j = 0; j < t.size(); ++j) {
            if(t[j]==s[i]&&j>=(i-1)/2&&j>it){
                f=true;
                it=j;
                break;
            }
        }
        canmake=f;
        if(!canmake)break;
    }
    if(canmake){
        cout<<"Yes"<<endl;
        return 0;
    }
    //ｔから始める
    it=-1;
    for (int i = 0; i < s.size(); i+=2) {
        bool f=false;
        for (int j = 0; j < t.size(); ++j) {
            if(t[j]==s[i]&&j>=i/2&&j>it){
                f=true;
                it=j;
                break;
            }
        }
        canmake=f;
        if(!canmake)break;
    }
    if(canmake)cout<<"Yes"<<endl;
    else cout<<"No"<<endl;
    return 0;
}

```