#include <bits/stdc++.h>
using namespace std;
#define FOR(i,k,n) for(int i = (int)(k); i < (int)(n); i++)
#define REP(i,n) FOR(i,0,n)
#define ALL(a) a.begin(), a.end()
#define MS(m,v) memset(m,v,sizeof(m))
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<string> vs;
typedef pair<int, int> pii;
const int MOD = 1e9 + 7;
template<class T> T &chmin(T &a, const T &b) { return a = min(a, b); }
template<class T> T &chmax(T &a, const T &b) { return a = max(a, b); }
template<class T>
istream& operator >> (istream& is, vector<T>& v)
{
	for (auto &i : v) is >> i;
	return is;
}
template<class T>
ostream& operator<<(ostream& os, vector<T>& v)
{
	const string delimiter = "\n";
	REP(i, v.size())
	{
		os << v[i];
		if (i != v.size() - 1) os << delimiter;
	}
	return os;
}
/*--------------------template--------------------*/

bool check(string s, string t)
{
	int sp = 0, tp = 0;
	while (tp < t.size())
	{
		if (s[sp] == t[tp]) tp++;
		sp++;
		if (sp == s.size() && tp != t.size()) return false;
	}
 	return true;
}

int main()
{
	cin.sync_with_stdio(false); cout << fixed << setprecision(10);
	string s, t;
	cin >> s >> t;
	string s1, s2;
	REP(i, s.size())
	{
		if (i % 2 == 0) s1.push_back(s[i]);
		else s2.push_back(s[i]);
	}
	if (check(t, s1) || check(t, s2)) cout << "Yes" << endl;
	else cout << "No" << endl;
	return 0;
}