from collections import deque

def solve(N, S, T):
    queue = deque([(S, 0)])
    visited = {S}

    while queue:
        current, step = queue.popleft()
        if current == T:
            return 'Yes'
        if step == N:
            continue
        for i in range(N):
            if current[i] == 'A':
                next_state = current[:i] + 'B' + current[i+1:]
                if next_state not in visited:
                    visited.add(next_state)
                    queue.append((next_state, step+1))
            elif current[i] == 'B':
                next_state = current[:i] + 'C' + current[i+1:]
                if next_state not in visited:
                    visited.add(next_state)
                    queue.append((next_state, step+1))
    return 'No'

N = int(input())
S = input()
T = input()
print(solve(N, S, T))