#include<iostream>
#include<cstdio>
#include<string>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
using namespace std;
typedef long long ll;
const ll MOD = 1000000007;
const ll INF = (ll)1000000007 * 1000000007;
const double EPS = 1e-9;
typedef pair<int, int> P;
typedef unsigned int ui;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
int main() {
	string s, t;
	cin >> s >> t;
	bool f = true;
	int len = s.length();
	int now = -1;
	for (int i = 0; i < len; i+=2) {
		now++;
		while (now<len&&t[now] != s[i])now++;
		if (now == len) {
			f = false; break;
		}
	}
	now = -1; bool g = true;
	for (int i = 1; i < len; i += 2) {
		now++;
		while (now<len&&t[now] != s[i])now++;
		if (now == len) {
			g = false; break;
		}
	}
	if (f||g)cout << "Yes" << endl;
	else cout << "No" << endl;
	return 0;
}


### Prompt

Please create a solution in Cpp to the following problem:

Example

Input

acmicpc
tsukuba


Output

No

### Response

```cpp
#include<iostream>
#include<cstdio>
#include<string>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
using namespace std;
typedef long long ll;
const ll MOD = 1000000007;
const ll INF = (ll)1000000007 * 1000000007;
const double EPS = 1e-9;
typedef pair<int, int> P;
typedef unsigned int ui;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
int main() {
	string s, t;
	cin >> s >> t;
	bool f = true;
	int len = s.length();
	int now = -1;
	for (int i = 0; i < len; i+=2) {
		now++;
		while (now<len&&t[now] != s[i])now++;
		if (now == len) {
			f = false; break;
		}
	}
	now = -1; bool g = true;
	for (int i = 1; i < len; i += 2) {
		now++;
		while (now<len&&t[now] != s[i])now++;
		if (now == len) {
			g = false; break;
		}
	}
	if (f||g)cout << "Yes" << endl;
	else cout << "No" << endl;
	return 0;
}


```