#include <iostream>
#include <queue>
#include <algorithm>
#include<set>
using namespace std;


int inf = 1e9;

int n;


char board[200'001][2];
bool visited[200'001][2];
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cin >> n;
    
    for(int i = 0; i < n; i++) cin >> board[i][0];
    for(int i = 0; i < n; i++) cin >> board[i][1];
    
    
    queue<pair<bool, int>> q;
    
    q.push({0, 0});
    if(board[0][1] == 'L') q.push({1, 0});
    
    
    
    while(!q.empty() && !visited[n-1][1]){
        auto [y, x] = q.front(); q.pop();
        
        int nx = x+1;
        bool ny = y;
        if(board[nx][y] =='L'){
            ny = !y;
            if(board[nx][ny] == 'I') continue;
        }

        if(0 <= nx && nx < n){
            visited[nx][ny] = true;
            q.push({ny, nx});
        }
        
    }
    

    
    if(visited[n-1][1]) cout << "YES";
    else cout << "NO";
    
    return 0;
}