#include "bits/stdc++.h"
#include<unordered_map>
#include<unordered_set>
#pragma warning(disable:4996)
using namespace std;
using ld = long double;
const ld eps = 1e-9;

//// < "d:\d_download\visual studio 2015\projects\programing_contest_c++\debug\a.txt" > "d:\d_download\visual studio 2015\projects\programing_contest_c++\debug\b.txt"


int main() {
	string S, T; cin >> S >> T;
	bool ans = false;
	{
		bool ok = true;
		int now = 0;
		for (int i = 0; i < S.size(); i += 2) {
			int next = T.find(S[i], now);
			if (next == string::npos) {
				ok = false;
				break;
			}
			now = next+1;

		}
		if (ok)ans = true;
	}
	{
		bool ok = true;
		int now = 0;
		for (int i = 1; i < S.size(); i += 2) {
			int next = T.find(S[i], now);
			if (next == string::npos) {
				ok = false;
				break;
			}
			now = next+1;

		}
		if (ok)ans = true;
	}
	if (ans)cout << "Yes" << endl;
	else 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
#include "bits/stdc++.h"
#include<unordered_map>
#include<unordered_set>
#pragma warning(disable:4996)
using namespace std;
using ld = long double;
const ld eps = 1e-9;

//// < "d:\d_download\visual studio 2015\projects\programing_contest_c++\debug\a.txt" > "d:\d_download\visual studio 2015\projects\programing_contest_c++\debug\b.txt"


int main() {
	string S, T; cin >> S >> T;
	bool ans = false;
	{
		bool ok = true;
		int now = 0;
		for (int i = 0; i < S.size(); i += 2) {
			int next = T.find(S[i], now);
			if (next == string::npos) {
				ok = false;
				break;
			}
			now = next+1;

		}
		if (ok)ans = true;
	}
	{
		bool ok = true;
		int now = 0;
		for (int i = 1; i < S.size(); i += 2) {
			int next = T.find(S[i], now);
			if (next == string::npos) {
				ok = false;
				break;
			}
			now = next+1;

		}
		if (ok)ans = true;
	}
	if (ans)cout << "Yes" << endl;
	else cout << "No" << endl;
	
	return 0;
}
```