/* -*- coding: utf-8 -*-
 *
 * 2629.cc:  No.2629 A replace B replace C - yukicoder
 */

#include<cstdio>
#include<algorithm>
 
using namespace std;

/* constant */

const int MAX_N = 200000;

/* typedef */

/* global variables */

char s[MAX_N + 4], t[MAX_N + 4];
int scs[3], tcs[3];

/* subroutines */

/* main */

int main() {
  int n;
  scanf("%d%s%s", &n, s, t);

  for (int i = 0; i < n; i++) scs[s[i] - 'A']++;
  for (int i = 0; i < n; i++) tcs[t[i] - 'A']++;

  if (scs[0] >= tcs[0] && scs[1] == tcs[1]) {
    int ab = 0, bc = 0, ac = 0;
    for (int i = 0; i < n; i++) {
      if (s[i] > t[i]) { puts("No"); return 0; }
      if (s[i] == 'A' && t[i] == 'B') ab++;
      else if (s[i] == 'B' && t[i] == 'C') bc++;
      else if (s[i] == 'A' && t[i] == 'C') ac++;
    }

    if (ab == bc && (ac == 0 || ab > 0)) { puts("Yes"); return 0; }
  }

  puts("No");
  return 0;
}