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<bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n ; i++)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define whole(f, x, ...) ([&](decltype((x)) whole) { return (f)(begin(whole), end(whole), ## __VA_ARGS__); })(x) // decltypeで型取得、引数があればva_argsのところに入れる
using namespace std;
typedef long long ll; // long longをllでかけるようにした
const int INF = 1e9;

int main(void){
    int n, a, b, c, d; cin >> n >> a >> b >> c >> d;
    string s; cin >> s;
    int count = 0;
    int cR = 0;
    vector<int> A(0);
    
    int countR = 0;
    REP(i, n) if(s[i] == '#') cR++;
    if(cR == 0){
        cout << "Yes" << endl;
        return 0;
    }
    FOR(i, a, c){
        if(s[i] == '#'){
            countR++;
        }
        else countR = 0;

        if(countR >= 2){
            cout << "No" << endl;
            return 0;
        }
    }
    countR = 0;
    FOR(i, b, d){
        if(s[i] == '#'){
            countR++;
        }
        else countR = 0;

        if(countR >= 2){
            cout << "No" << endl;
            return 0;
        }
    }
    FOR(i, a - 1, s.size()) {
        if(s[i] == '.'){
            count++;
        }
        else{
            A.push_back(count);
            count = 0;
        }
    }
    whole(sort, A, greater<>());
    if(A[0] >= 3){
        if(b + 1 == d and s[d] == '#') cout << "No" << endl;
        else cout << "Yes" << endl;
    }
    else{
        if(c < d) cout << "Yes" << endl;
        else cout << "No" << endl;
    }
}