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

#define fi first
#define se second
#define repl(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define repr(i,n) for(int i=(int)(n-1);i>=0;i--)
#define rep(i,n) repl(i,0,n)
#define each(itr,v) for(auto itr:v)
#define pb(s) push_back(s)
#define all(x) (x).begin(),(x).end()
#define dbg(x) cout << #x" = " << x << endl
#define print(x) cout << x << endl
#define maxch(x,y) x=max(x,y)
#define minch(x,y) x=min(x,y)
#define uni(x) x.erase(unique(all(x)),x.end())
#define exist(x,y) (find(all(x),y)!=x.end())
#define bcnt(x) bitset<32>(x).count()

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> P;
typedef pair<P, int> PPI;
typedef pair<int, P> PIP;
typedef pair<ll, ll> PL;
typedef pair<P, ll> PPL;
typedef set<int> S;

#define INF INT_MAX/3
#define MAX_N 1000000001


int main(){
    cin.sync_with_stdio(false);
    string s, t;
    cin >> s >> t;

    string a = "", b = "";
    rep(i, s.size()) {
        if (i % 2) a += s[i];
        else b += s[i];
    }

    bool ok = false;
    int j = 0;
    rep(i, t.size()) {
        if (a[j] == t[i]) j++;
        if (j == a.size()) break;
    }
    if (j == a.size()) ok = true;

    j = 0;
    rep(i, t.size()) {
        if (b[j] == t[i]) j++;
        if (j == b.size()) break;
    }
    if (j == b.size()) ok = true;

    if(ok) cout << "Yes" << endl;
    else cout << "No" << endl;

    return 0;
}