#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;++i)
using namespace std;
 
 
 
int main(void){
	string s,t;
	cin >> s >> t;
	int n=s.size();
	
	bool ok=false;
	int cur=0,idx=0;
	
	while(idx<n&&cur<t.size()){
		if(s[idx]==t[cur]) idx+=2;
		cur++;
	}
 
	if(idx>=n) ok=true;
 
	cur=0,idx=1;
	while(idx<n&&cur<t.size()){
		if(s[idx]==t[cur]) idx+=2;
		cur++;
	}
 
	if(idx>=n) ok=true;
 
	if(ok)
		puts("Yes");
	else
		puts("No");
	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>
#define rep(i,n) for(int i=0;i<n;++i)
using namespace std;
 
 
 
int main(void){
	string s,t;
	cin >> s >> t;
	int n=s.size();
	
	bool ok=false;
	int cur=0,idx=0;
	
	while(idx<n&&cur<t.size()){
		if(s[idx]==t[cur]) idx+=2;
		cur++;
	}
 
	if(idx>=n) ok=true;
 
	cur=0,idx=1;
	while(idx<n&&cur<t.size()){
		if(s[idx]==t[cur]) idx+=2;
		cur++;
	}
 
	if(idx>=n) ok=true;
 
	if(ok)
		puts("Yes");
	else
		puts("No");
	return 0;
}	
```