#include<iostream>
#include<string>
#include<iomanip>
#include<cmath>
#include<vector>
#include<algorithm>

using namespace std;

//http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=2727

#define int long long
#define rep(i,n) for(int i = 0; i < (n); i++)
#define INF ((long long)1e18)
#define MOD ((int)1e9+7)
#define endl "\n"

#define yn(f) ((f)?"Yes":"No")
#define YN(f) ((f)?"YES":"NO")

#define MAX

signed main(){
	cin.tie(0);
	ios::sync_with_stdio(false);
	cout<<fixed<<setprecision(10);
	
	string S, T;
	string t, t2;
	
	cin>>S>>T;
	
	for(int i = 0; i < S.size(); i++){
		if(i%2) t += S[i];
		else t2 += S[i];
	}

	bool flag = true, flag2 = true;;
	
	for(int i = 0, j = 0; i < t.size(); i++,j++){
		for(; j < T.size(); j++){
			if(T[j] == t[i]){
				break;
			}
		}
		if(j == T.size()){
			flag = false;
			break;
		}
	}
	for(int i = 0, j = 0; i < t2.size(); i++,j++){
		for(; j < T.size(); j++){
			if(T[j] == t2[i]){
				break;
			}
		}
		if(j == T.size()){
			flag2 = false;
			break;
		}
	}
	
	cout<<yn(flag||flag2)<<endl;
	
	return 0;
}

### Prompt

In cpp, your task is to solve the following problem:

Example

Input

acmicpc
tsukuba


Output

No

### Response

```cpp
#include<iostream>
#include<string>
#include<iomanip>
#include<cmath>
#include<vector>
#include<algorithm>

using namespace std;

//http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=2727

#define int long long
#define rep(i,n) for(int i = 0; i < (n); i++)
#define INF ((long long)1e18)
#define MOD ((int)1e9+7)
#define endl "\n"

#define yn(f) ((f)?"Yes":"No")
#define YN(f) ((f)?"YES":"NO")

#define MAX

signed main(){
	cin.tie(0);
	ios::sync_with_stdio(false);
	cout<<fixed<<setprecision(10);
	
	string S, T;
	string t, t2;
	
	cin>>S>>T;
	
	for(int i = 0; i < S.size(); i++){
		if(i%2) t += S[i];
		else t2 += S[i];
	}

	bool flag = true, flag2 = true;;
	
	for(int i = 0, j = 0; i < t.size(); i++,j++){
		for(; j < T.size(); j++){
			if(T[j] == t[i]){
				break;
			}
		}
		if(j == T.size()){
			flag = false;
			break;
		}
	}
	for(int i = 0, j = 0; i < t2.size(); i++,j++){
		for(; j < T.size(); j++){
			if(T[j] == t2[i]){
				break;
			}
		}
		if(j == T.size()){
			flag2 = false;
			break;
		}
	}
	
	cout<<yn(flag||flag2)<<endl;
	
	return 0;
}

```