Problem:
Score : 400 points

Problem Statement

There are N squares arranged in a row, numbered 1, 2, ..., N from left to right.
You are given a string S of length N consisting of . and #. If the i-th character of S is #, Square i contains a rock; if the i-th character of S is ., Square i is empty.

In the beginning, Snuke stands on Square A, and Fnuke stands on Square B.

You can repeat the following operation any number of times:

Choose Snuke or Fnuke, and make him jump one or two squares to the right. The destination must be one of the squares, and it must not contain a rock or the other person.

You want to repeat this operation so that Snuke will stand on Square C and Fnuke will stand on Square D.

Determine whether this is possible.

Constraints

4 \leq N \leq 200\ 000

S is a string of length N consisting of . and #.

1 \leq A, B, C, D \leq N

Square A, B, C and D do not contain a rock.

A, B, C and D are all different.

A < B

A < C

B < D

Input

Input is given from Standard Input in the following format:

N A B C D
S

Output

Print Yes if the objective is achievable, and No if it is not.

Sample Input 1

7 1 3 6 7
.#..#..

Sample Output 1

Yes

The objective is achievable by, for example, moving the two persons as follows. (A and B represent Snuke and Fnuke, respectively.)

A#B.#..

A#.B#..

.#AB#..

.#A.#B.

.#.A#B.

.#.A#.B

.#..#AB

Sample Input 2

7 1 3 7 6
.#..#..

Sample Output 2

No

Sample Input 3

15 1 3 15 13
...#.#...#.#...

Sample Output 3

Yes

Solution in C++14 (GCC 5.4.1) (judge verdict: Wrong Answer)

#include <iostream>
#include <vector>
#include <algorithm>
#include <string>

using namespace std;

bool continuous1(string str);
bool continuous2(int n, string str);

int main(){
    int N, A, B, C, D;
    cin >> N >> A >> B >> C >> D;
    string S;
    cin >> S;
    
    bool flag = true;
    int right = 100000000;
    for(int i = 0; i < N; i++){
        if(!flag && S[i] == '#'){
            cout << "No\n";
            return 0;
        }
        if(S[i] == '.'){
            flag = true;
        }
        else{
            flag = false;
            right = i;
        }
    }
    
    bool judge = true;

    if(C < D){
        S[D - 1] = '#';
        if(D - 1 > right){
            right = D - 1;
        }
        if(C - 1 < right){
            judge = true;
        }
        else{
            judge = continuous1(S);
        }
    }
    else{       // C > D
        if(!continuous2(D, S)){
            cout << "No\n";
            return 0;
        }
        else{
            judge = true;
        }
    }
        
    if(judge){
        cout << "Yes\n";
    }
    else{
        cout << "No\n";
    }
}

bool continuous1(string str){
    bool flag = true;
    
    for(int i = 0; i < str.length(); i++){
        if(!flag && (str[i] == '#' || str[i] == 'A' || str[i] == 'B')){
            cout << "No\n";
            return false;
        }
        if(str[i] == '.'){
            flag = true;
        }
        else{
            flag = false;
        }
    }
    
    return true;
}

bool continuous2(int n, string str){
    bool flag1 = false;
    bool flag2 = false;
    bool judge = false;
    
    for(int i = 0; i < n; i++){
        if(str[i] == '#'){
            flag1 = flag2 = false;
            continue;
        }
        
        if(!flag1){
            flag1 = true;
        }
        else if(flag1 && !flag2){
            flag2 = true;
        }
        else if(flag1 && flag2){
            judge = true;
            break;
        }
        else    ;
    }
    
    return judge;
}