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>

using namespace std;
typedef long long LL;
typedef pair<int,int> pii;

const int MAXN = 2e5 + 5;
const int MOD = 1e9 + 7;
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second 
#define FAIL0 {cout << "0\n"; return 0;}
#define FAIL1 {cout << "-1\n"; return 0;}
#define FAILNO {cout << "No\n"; return 0;}

int N;
char S[MAXN];
int a,b,c,d;

int main(int argc, char **argv) {
#ifdef OJ
    freopen("input.txt", "rt", stdin);
    //freopen("output.txt", "wt", stdout);
#endif
    ios::sync_with_stdio(false);
    cin.tie(0);

    cin >> N >> a >> b >> c >> d >> S;
    a--; b--; c--; d--;

    if(d > c) {
        while(b < d) {
            if (S[b+1] == '.') b++;
            else if (S[b+2] == '.') b += 2;
            else FAILNO;
        }

        while(a < c) {
            if (S[a+1] == '.') a++;
            else if (S[a+2] == '.') a += 2;
            else FAILNO;
        }

        cout << "Yes\n";
    } else {
        while(b < d) {
            if (S[b+1] == '.') b++;
            else if (S[b+2] == '.') b += 2;
            else FAILNO;
        }

        if (a+1 == b && S[b+1] == '.') {
            a = b+1;
            while(a < c) {
                if (S[a+1] == '.') a++;
                else if (S[a+2] == '.') a += 2;
                else FAILNO;
            }
        } else {
            int ok = 0;
            for (int i = a+1; !ok && i+2 <= c; i++) 
                if (S[i] == '.' &&
                        S[i+1] == '.' &&
                        S[i+2] == '.') {
                    ok = 1;
                }

            if (!ok) FAILNO;
        }

        cout << "Yes\n";
    }
    return 0;
}