#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;

int main() {
    string s, t; cin >> s >> t;
    vector<string> ss(2);
    for (int i = 0; i < (int)s.size(); i++) ss[i & 1] += s[i];
    auto check = [&](string &sub) {
        int p = 0, n = sub.size();
        for (char c: t) if (c == sub[p]) if (++p == n) return true;
        return p == n;
    };
    cout << (check(ss[0]) || check(ss[1]) ? "Yes" : "No") << endl;
    return 0;
}


### Prompt

Develop a solution in Cpp to the problem described below:

Example

Input

acmicpc
tsukuba


Output

No

### Response

```cpp
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;

int main() {
    string s, t; cin >> s >> t;
    vector<string> ss(2);
    for (int i = 0; i < (int)s.size(); i++) ss[i & 1] += s[i];
    auto check = [&](string &sub) {
        int p = 0, n = sub.size();
        for (char c: t) if (c == sub[p]) if (++p == n) return true;
        return p == n;
    };
    cout << (check(ss[0]) || check(ss[1]) ? "Yes" : "No") << endl;
    return 0;
}


```