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

//* ATCODER
#include<atcoder/all>
using namespace atcoder;
typedef modint998244353 mint;
//*/

/* BOOST MULTIPRECISION
#include<boost/multiprecision/cpp_int.hpp>
using namespace boost::multiprecision;
//*/

typedef long long ll;

#define rep(i, s, n) for (int i = (int)(s); i < (int)(n); i++)
#define rrep(i, s, n) for (int i = (int)(n)-1; i >= (int)(s); i--)

template <typename T> bool chmin(T &a, const T &b) {
	if (a <= b) return false;
	a = b;
	return true;
}

template <typename T> bool chmax(T &a, const T &b) {
	if (a >= b) return false;
	a = b;
	return true;
}

template <typename T> T max(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmax(ret, a[i]);
	return ret;
}

template <typename T> T min(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmin(ret, a[i]);
	return ret;
}

template <typename T> T sum(vector<T> &a){
	T ret = 0;
	for (int i=0; i<(int)a.size(); i++) ret += a[i];
	return ret;
}

int main(){
	int n; cin >> n;
	string s; cin >> s;
	string t; cin >> t;
	int AC = 0;
	int AB = 0;
	int BC = 0;
	rep(i,0,n){
		if (s[i] > t[i]){
			cout << "No\n";
			return 0;
		}
		if (s[i] == 'A' and t[i] == 'C') AC++;
		if (s[i] == 'A' and t[i] == 'B') AB++;
		if (s[i] == 'B' and t[i] == 'C') BC++;
	}

	while(AC > 0 || AB > 0 || BC > 0){
		if (AC > 0){
			if (BC == 0){
				cout << "No\n";
				return 0;
			}
			AC -= 1;
			BC -= 1;
			BC += 1;
		}else if(AB > 0){
			if (BC == 0){
				cout << "No\n";
				return 0;
			}
			AB -= 1;
			BC -= 1;
		}else{
			cout << "No\n";
			return 0;
		}
	}

	cout << "Yes\n";
	return 0;
}