#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<ll, ll> P;

#define each(i,a) for (auto&& i : a)
#define FOR(i,a,b) for (ll i=(a),__last_##i=(b);i<__last_##i;i++)
#define RFOR(i,a,b) for (ll i=(b)-1,__last_##i=(a);i>=__last_##i;i--)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) RFOR(i,0,n)
#define __GET_MACRO3(_1, _2, _3, NAME, ...) NAME
#define rep(...) __GET_MACRO3(__VA_ARGS__, FOR, REP)(__VA_ARGS__)
#define rrep(...) __GET_MACRO3(__VA_ARGS__, RFOR, RREP)(__VA_ARGS__)
#define pb push_back
#define all(a) (a).begin(),(a).end()
#define chmin(x,v) x = min(x, v)
#define chmax(x,v) x = max(x, v)

const ll linf = 1e18;
const int inf = 1e9;
const double eps = 1e-12;
const double pi = acos(-1);

template<typename T>
istream& operator>>(istream& is, vector<T>& vec) {
    each(x,vec) is >> x;
    return is;
}
template<typename T>
ostream& operator<<(ostream& os, const vector<T>& vec) {
    rep(i,vec.size()) {
        if (i) os << " ";
        os << vec[i];
    }
    return os;
}
template<typename T>
ostream& operator<<(ostream& os, const vector< vector<T> >& vec) {
    rep(i,vec.size()) {
        if (i) os << endl;
        os << vec[i];
    }
    return os;
}
bool is_in(const string& s, const string& t) {
    ll pos = 0;
    each(c, s) {
        if (pos >= t.size()) return true;
        if (c == t[pos]) ++pos;
    }
    if (pos >= t.size()) return true;
    return false;
}
int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    string s1, s2; cin >> s1 >> s2;
    string s[2] = {s1, s2};
    const ll n1 = s1.size(), n2 = s2.size();
    string odd = "", even = "";
    rep(i, n1) {
        if (i % 2) odd += s1[i];
        else even += s1[i];
    }
    if ((is_in(s1, odd) && is_in(s2, even)) || (is_in(s2, odd) && is_in(s1, even))) {
        cout << "Yes" << endl;
    }
    else {
        cout << "No" << endl;
    }
}
### 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;

typedef long long ll;
typedef pair<ll, ll> P;

#define each(i,a) for (auto&& i : a)
#define FOR(i,a,b) for (ll i=(a),__last_##i=(b);i<__last_##i;i++)
#define RFOR(i,a,b) for (ll i=(b)-1,__last_##i=(a);i>=__last_##i;i--)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) RFOR(i,0,n)
#define __GET_MACRO3(_1, _2, _3, NAME, ...) NAME
#define rep(...) __GET_MACRO3(__VA_ARGS__, FOR, REP)(__VA_ARGS__)
#define rrep(...) __GET_MACRO3(__VA_ARGS__, RFOR, RREP)(__VA_ARGS__)
#define pb push_back
#define all(a) (a).begin(),(a).end()
#define chmin(x,v) x = min(x, v)
#define chmax(x,v) x = max(x, v)

const ll linf = 1e18;
const int inf = 1e9;
const double eps = 1e-12;
const double pi = acos(-1);

template<typename T>
istream& operator>>(istream& is, vector<T>& vec) {
    each(x,vec) is >> x;
    return is;
}
template<typename T>
ostream& operator<<(ostream& os, const vector<T>& vec) {
    rep(i,vec.size()) {
        if (i) os << " ";
        os << vec[i];
    }
    return os;
}
template<typename T>
ostream& operator<<(ostream& os, const vector< vector<T> >& vec) {
    rep(i,vec.size()) {
        if (i) os << endl;
        os << vec[i];
    }
    return os;
}
bool is_in(const string& s, const string& t) {
    ll pos = 0;
    each(c, s) {
        if (pos >= t.size()) return true;
        if (c == t[pos]) ++pos;
    }
    if (pos >= t.size()) return true;
    return false;
}
int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    string s1, s2; cin >> s1 >> s2;
    string s[2] = {s1, s2};
    const ll n1 = s1.size(), n2 = s2.size();
    string odd = "", even = "";
    rep(i, n1) {
        if (i % 2) odd += s1[i];
        else even += s1[i];
    }
    if ((is_in(s1, odd) && is_in(s2, even)) || (is_in(s2, odd) && is_in(s1, even))) {
        cout << "Yes" << endl;
    }
    else {
        cout << "No" << endl;
    }
}
```