#include<bits/stdc++.h>
using namespace std;
#define ll long long
typedef pair<ll,ll> P;
typedef pair<ll,P> PP;
const ll MOD = 1e9+7;

int main(){
  
  string s,t;
  
  cin >> s >> t;
  
  int f = 0;
  
  string a[2] = {"",""};
  
  int n = s.size();
  
  for(int i = 0; i < n ; i++)a[i%2] += s[i];
  
  for(int i = 0; i < 2 ; i++){
    
    int cnt = 0;
    
    for(int j = 0 ; j < n ; j++){
	 
	 if(cnt < a[i].size()&&t[j] == a[i][cnt])cnt++;
	 
    }
    
    if(cnt == a[i].size())f = 1;
  }
  
  cout << (f?"Yes":"No") << endl;
  
  return 0;
}


### Prompt

Construct a CPP code solution to the problem outlined:

Example

Input

acmicpc
tsukuba


Output

No

### Response

```cpp
#include<bits/stdc++.h>
using namespace std;
#define ll long long
typedef pair<ll,ll> P;
typedef pair<ll,P> PP;
const ll MOD = 1e9+7;

int main(){
  
  string s,t;
  
  cin >> s >> t;
  
  int f = 0;
  
  string a[2] = {"",""};
  
  int n = s.size();
  
  for(int i = 0; i < n ; i++)a[i%2] += s[i];
  
  for(int i = 0; i < 2 ; i++){
    
    int cnt = 0;
    
    for(int j = 0 ; j < n ; j++){
	 
	 if(cnt < a[i].size()&&t[j] == a[i][cnt])cnt++;
	 
    }
    
    if(cnt == a[i].size())f = 1;
  }
  
  cout << (f?"Yes":"No") << endl;
  
  return 0;
}


```