#include <bits/stdc++.h>
using namespace std;

#define max(a,b) ((a)>(b)?(a):(b))
#define min(a,b) ((a)<(b)?(a):(b))

typedef long long LL;

int main(){
  string s,t;
  cin >> s >> t;
  int i=0;
  for(int j=0;j<t.length();j++){
    if(s[i]==t[j]){
      i+=2;
      if(i>=s.length()){
        cout << "Yes" << endl;
        return 0;
      }
    }
  }
  i=1;
  for(int j=0;j<t.length();j++){
    if(s[i]==t[j]){
      i+=2;
      if(i>=s.length()){
        cout << "Yes" << endl;
        return 0;
      }
    }
  }
  if(s.length()<=1){
    cout << "Yes" << endl;
    return 0;
  }
  cout << "No" << endl;
  return 0;
}


### Prompt

Create a solution in Cpp for the following problem:

Example

Input

acmicpc
tsukuba


Output

No

### Response

```cpp
#include <bits/stdc++.h>
using namespace std;

#define max(a,b) ((a)>(b)?(a):(b))
#define min(a,b) ((a)<(b)?(a):(b))

typedef long long LL;

int main(){
  string s,t;
  cin >> s >> t;
  int i=0;
  for(int j=0;j<t.length();j++){
    if(s[i]==t[j]){
      i+=2;
      if(i>=s.length()){
        cout << "Yes" << endl;
        return 0;
      }
    }
  }
  i=1;
  for(int j=0;j<t.length();j++){
    if(s[i]==t[j]){
      i+=2;
      if(i>=s.length()){
        cout << "Yes" << endl;
        return 0;
      }
    }
  }
  if(s.length()<=1){
    cout << "Yes" << endl;
    return 0;
  }
  cout << "No" << endl;
  return 0;
}


```