#include <bits/stdc++.h>
using namespace std;
typedef int int2;
#define int long long
#define pi pair<int, int>
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define f first
#define s second
const int inf = 1e18;
int t;
const int maxn = 1e5 + 5;
vector<int> divs[maxn];
int dp[maxn];
#define EPS 1e-4
void gg() {
    cout << "NO\n";
    exit(0);
}
typedef double D;
D dis(D a, D b, D c, D d) {
    D dx = c - a;
    D dy = d - b;
    return sqrt(dx * dx + dy * dy);
}
bool check(string A, string B, string S) {
    int n = S.size();
    int ia = 0;
    int ib = 0;
    bool possible = true;
    for (int i = 0; i < n; i++) {
        if (i % 2 == 0) {
            while (ia < (int)A.size() and A[ia] != S[i]) {
                ia++;
            }
            if (ia == (int)A.size()) possible = false;
            ia++;
        } else {
            while (ib < (int)B.size() and B[ib] != S[i]) {
                ib++;
            }
            if (ib == (int)B.size()) possible = false;
            ib++;
        }
    }
    return possible;
}
int2 main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    string S, T;
    cin >> S >> T;
    string target = S;
    if (check(S, T, target) or check(T, S, target)) {
        cout << "Yes\n";
    } else {
        cout << "No\n";
    }  
} 

/*#include <bits/stdc++.h>

using namespace std;
using ll = long long;

#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
#define pb push_back
#define ff first
#define sc second

const int MAXV = 10000000;
int val[MAXV], stepp[MAXV];
int dist[MAXV];
const int MAXV2 = 30010;
vector<int> g_lol[MAXV2];

void solve() {
    int n, m; cin >> n >> m;
    int curv = n;
    map<pair<int, int>, int> pos;
    int p0, p1;
    for (int i = 0; i < m; i++) {
        int b, g; cin >> b >> g;
        if (i == 0) p0 = b;
        if (i == 1) p1 = b;
        if (pos.find({b % g, g}) != pos.end()) {
            int step = (b - b % g) / g;
            g_lol[b].pb(pos[{b % g, g}] + step);
            continue;
        }
        pos[{b % g, g}] = curv;
        int step = (b - b % g) / g;
        g_lol[b].pb(pos[{b % g, g}] + step);
        for (int j = b % g; j < n; j += g) {
            val[curv] = j;
            stepp[curv] = g;
            curv++;
        }
    }
    for (int i = 0; i < curv; i++) dist[i] = 1e9;
    dist[p0] = 0;

    deque<int> q;
    q.push_back(p0);
    while (!q.empty()) {
        int v = q.front();
        q.pop_front();
        if (v < n) {
            for (int el : g_lol[v]) {
                if (dist[el] > dist[v]) {
                    dist[el] = dist[v];
                    q.push_front(el);
                }
            }
        } else {
            if (val[v] - stepp[v] >= 0 && dist[v - 1] > dist[v] + 1) {
                dist[v - 1] = dist[v] + 1;
                q.push_back(v - 1);
            }
            if (val[v] + stepp[v] < n && dist[v + 1] > dist[v] + 1) {
                dist[v + 1] = dist[v] + 1;
                q.push_back(v + 1);
            }
            if (dist[val[v]] > dist[v]) {
                dist[val[v]] = dist[v];
                q.push_front(val[v]);
            }
        }
    }
    cout << (dist[p1] == 1e9 ? -1 : dist[p1]) << '\n';
}

signed main() {
    int tt = 1;
    #ifdef LOCAL 
        freopen("in.txt", "r", stdin);
        freopen("out.txt", "w", stdout);
        cin >> tt;
    #else
        ios::sync_with_stdio(false); 
        cin.tie(0); cout.tie(0);
    #endif

    while (tt--) {
        solve();
    }

    return 0;
}*/