#include "iostream"
#include "climits"
#include "list"
#include "queue"
#include "stack"
#include "set"
#include "functional"
#include "algorithm"
#include "string"
#include "map"
#include "unordered_map"
#include "unordered_set"
#include "iomanip"
#include "cmath"
#include "random"
#include "bitset"
#include "cstdio"
#include "numeric"
#include "cassert"
#include "ctime"

using namespace std;

constexpr long long int MOD = 1000000007;
//constexpr int MOD = 1000000007;
//constexpr int MOD = 998244353;
//constexpr long long int MOD = 998244353;
constexpr double EPS = 1e-12;

//int N, M, K, T, H, W, L, R;
long long int N, M, K, T, H, W, L, R;



int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);

	string s, t;
	cin >> s >> t;
	int a = 0, b = 0;
	bool flag = false;
	for (int i = 0; i < s.size(); i++) {
		if (i & 1) {
			while (b < t.size() && t[b] != s[i])b++;
			if (b >= t.size())break;
			b++;
		}
		else {
			while (a < s.size() && s[a] != s[i])a++;
			if (a >= s.size())break;
			a++;
		}
		if (i + 1 == s.size())flag = true;
	}
	a = b = 0;
	for (int i = 0; i < s.size(); i++) {
		if ((i & 1) == 0) {
			while (b < t.size() && t[b] != s[i])b++;
			if (b >= t.size())break;
			b++;
		}
		else {
			while (a < s.size() && s[a] != s[i])a++;
			if (a >= s.size())break;
			a++;
		}
		if (i + 1 == s.size())flag = true;
	}
	if (flag)cout << "Yes\n";
	else cout << "No\n";
}

### Prompt

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

Example

Input

acmicpc
tsukuba


Output

No

### Response

```cpp
#include "iostream"
#include "climits"
#include "list"
#include "queue"
#include "stack"
#include "set"
#include "functional"
#include "algorithm"
#include "string"
#include "map"
#include "unordered_map"
#include "unordered_set"
#include "iomanip"
#include "cmath"
#include "random"
#include "bitset"
#include "cstdio"
#include "numeric"
#include "cassert"
#include "ctime"

using namespace std;

constexpr long long int MOD = 1000000007;
//constexpr int MOD = 1000000007;
//constexpr int MOD = 998244353;
//constexpr long long int MOD = 998244353;
constexpr double EPS = 1e-12;

//int N, M, K, T, H, W, L, R;
long long int N, M, K, T, H, W, L, R;



int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);

	string s, t;
	cin >> s >> t;
	int a = 0, b = 0;
	bool flag = false;
	for (int i = 0; i < s.size(); i++) {
		if (i & 1) {
			while (b < t.size() && t[b] != s[i])b++;
			if (b >= t.size())break;
			b++;
		}
		else {
			while (a < s.size() && s[a] != s[i])a++;
			if (a >= s.size())break;
			a++;
		}
		if (i + 1 == s.size())flag = true;
	}
	a = b = 0;
	for (int i = 0; i < s.size(); i++) {
		if ((i & 1) == 0) {
			while (b < t.size() && t[b] != s[i])b++;
			if (b >= t.size())break;
			b++;
		}
		else {
			while (a < s.size() && s[a] != s[i])a++;
			if (a >= s.size())break;
			a++;
		}
		if (i + 1 == s.size())flag = true;
	}
	if (flag)cout << "Yes\n";
	else cout << "No\n";
}

```