//#define __USE_MINGW_ANSI_STDIO 0
#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<ll> VL;
typedef vector<VL> VVL;
typedef pair<int, int> PII;

#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x.end()
#define MP make_pair
#define PB push_back
#define MOD 1000000007
#define INF (1LL<<30)
#define LLINF (1LL<<60)
#define PI 3.14159265359
#define EPS 1e-12
//#define int ll

signed main(void)
{
	string s, t;
	cin >> s >> t;

	bool flag = true;
	int cnt = 0;
	for(int i=0; i<s.size(); i+=2) {
		while(cnt < t.size() && t[cnt] != s[i]) cnt++;
		if(cnt == t.size()) {flag = false; break;}
		cnt++;
		//cout << i << " " << cnt << endl;
	}
	if(flag) {cout << "Yes" << endl; return 0;}

	flag = true;
	cnt = 0;
	for(int i=1; i<s.size(); i+=2) {
		while(cnt < t.size() && t[cnt] != s[i]) cnt++;
		if(cnt == t.size()) {flag = false; break;}
		cnt++;
	}
	if(flag) {cout << "Yes" << endl; return 0;}
	cout << "No" << endl;

	return 0;
}
### Prompt

Your task is to create a cpp solution to the following problem:

Example

Input

acmicpc
tsukuba


Output

No

### Response

```cpp
//#define __USE_MINGW_ANSI_STDIO 0
#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<ll> VL;
typedef vector<VL> VVL;
typedef pair<int, int> PII;

#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x.end()
#define MP make_pair
#define PB push_back
#define MOD 1000000007
#define INF (1LL<<30)
#define LLINF (1LL<<60)
#define PI 3.14159265359
#define EPS 1e-12
//#define int ll

signed main(void)
{
	string s, t;
	cin >> s >> t;

	bool flag = true;
	int cnt = 0;
	for(int i=0; i<s.size(); i+=2) {
		while(cnt < t.size() && t[cnt] != s[i]) cnt++;
		if(cnt == t.size()) {flag = false; break;}
		cnt++;
		//cout << i << " " << cnt << endl;
	}
	if(flag) {cout << "Yes" << endl; return 0;}

	flag = true;
	cnt = 0;
	for(int i=1; i<s.size(); i+=2) {
		while(cnt < t.size() && t[cnt] != s[i]) cnt++;
		if(cnt == t.size()) {flag = false; break;}
		cnt++;
	}
	if(flag) {cout << "Yes" << endl; return 0;}
	cout << "No" << endl;

	return 0;
}
```