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: Accepted)

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <vector>
#include <string>
#include <queue>
#include <deque>
#include <list>
#include <stack>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <algorithm>
#include <cassert>

#define int long long
#define MOD7 1000000007
#define MOD9 1000000009

#define rep(i, n) for (int i = 0; i < (n); i++)
#define itrep(i, a) for (auto i = (a).begin(); i != (a).end(); i++)
#define REP(i, a, n) for (int i = (a); i <= (n); i++)
#define all(a) (a).begin(), (a).end()
#define mp(a, b) make_pair((a), (b))

using namespace std;

int dx[4] = { 1, 0, -1, 0 };
int dy[4] = { 0, -1, 0, 1 };

template<class T> void inputVector(vector<T>& v, int n) {
    v.resize(n);
    for (int i = 0; i < v.size(); i++) cin >> v[i];
}

string S;
bool check(int idx1, int idx2) {
    int cnt = 0;
    REP(i, idx1, idx2) {
        if (S[i] == '#') cnt++;
        else cnt = 0;

        if (cnt >= 2) return false;
    }
    return true;
}

int N;
bool check2(int A, int B, int C, int D) {
    if (!check(A, C) || !check(B, D)) return false;

    while (true) {
        if (A + 2 <= C && S[A + 2] == '.' && A + 2 != B) {
            A += 2;
        } else if (A + 1 <= C && S[A + 1] == '.' && A + 1 != B) {
            A += 1;
        } else if (B + 1 <= D && S[B + 1] == '.') {
            B += 1;
        } else if (B + 2 <= D && S[B + 2] == '.') {
            B += 2;
        } else return false;

        if (A > B) return true;
    }
}

signed main() {
    int A, B, C, D;
    cin >> N >> A >> B >> C >> D >> S;
    A--; B--; C--; D--;

    string yes = "Yes";
    string no = "No";

    if ((A < B && B < C && C < D)
        || (A < C && C < B && B < D)) {
        if (check(A, C) && check(B, D)) {
            cout << yes << endl;
        } else {
            cout << no << endl;
        }
    } else if (A < B && B < D && D < C) {
        if (check2(A, B, C, D)) {
            cout << yes << endl;
        } else {
            cout << no << endl;
        }
    } else assert(false);

    return 0;
}