#define  _CRT_SECURE_NO_WARNINGS
#pragma comment (linker, "/STACK:526000000")

#include "bits/stdc++.h"

using namespace std;
typedef string::const_iterator State;
#define eps 1e-11L
#define MAX_MOD 1000000007LL
#define GYAKU 500000004LL

#define MOD 998244353LL
#define seg_size 262144*2LL
#define pb push_back
#define mp make_pair
typedef long long ll;
#define REP(a,b) for(long long (a) = 0;(a) < (b);++(a))
#define ALL(x) (x).begin(),(x).end()

unsigned long xor128() {
	static unsigned long x = 123456789, y = 362436069, z = 521288629, w = time(NULL);
	unsigned long t = (x ^ (x << 11));
	x = y; y = z; z = w;
	return (w = (w ^ (w >> 19)) ^ (t ^ (t >> 8)));
}

void init() {
	iostream::sync_with_stdio(false);
	cout << fixed << setprecision(20);
}

#define int ll
void solve() {
	string s, t;
	cin >> s >> t;
	if (s.length() == 1) {
		cout << "Yes" << endl;
		return;
	}
	{
		int now = -1;
		for (int i = 1; i < s.length(); i += 2) {
			while (true) {
				now++;
				if (now >= t.length()) break;
				if (s[i] == t[now]) break;
			}
		}
		if (now < t.length()) {
			cout << "Yes" << endl;
			return;
		}
	}
	{
		int now = -1;
		for (int i = 0; i < s.length(); i += 2) {
			while (true) {
				now++;
				if (now >= t.length()) break;
				if (s[i] == t[now]) break;
			}
		}
		if (now < t.length()) {
			cout << "Yes" << endl;
			return;
		}
	}
	cout << "No" << endl;
}

#undef int
int main() {
	init();
	solve();
}
