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 (Clang 3.8.0) (judge verdict: Accepted)

#include <stdio.h>
#include <stdlib.h>

int main(void) {
    int n, a, b, c, d;
    char *s;

    scanf("%d%d%d%d%d", &n, &a, &b, &c, &d);

    s = calloc(n, sizeof(char));

    scanf("%s", s);

    int a_1 = a;
    int b_1 = b;

    if (c < d) {
        while (a_1 != a || b_1 != d) {
            int i = 0;
            int a_2 = a_1;
            int b_2 = b_1;

            if (b_1 != d && s[b_1] == '.')
                b_2 += 1;
            else if(b_1 != d && s[b_1 + 1] == '.')
                b_2 += 2;
            if (a_1 != c && s[a_1] == '.' && b_1 != a_1 + 1)
                a_2 += 1;
            else if (a_1 != c && s[a_1 + 1] == '.' && b_1 != a_1 + 2)
                a_2 += 2;

            if (a_1 == a_2 && b_1 == b_2)
                break;
            else {
                a_1 = a_2;
                b_1 = b_2;
            }
        }
    }

    if (c > d) {
        while (a_1 != a || b_1 != d) {
            int i = 0;
            int a_2 = a_1;
            int b_2 = b_1;


            if (s[b_1 - 2] == '.' && s[b_1] == '.' && a_2 < b_2)
                a_2 = b_2 + 1;

            if (b_1 != d && s[b_1] == '.')
                b_2 += 1;
            else if(b_1 != d && s[b_1 + 1] == '.')
                b_2 += 2;
            if (a_1 != c && s[a_1] == '.' && b_1 != a_1 + 1)
                a_2 += 1;
            else if (a_1 != c && s[a_1 + 1] == '.' && b_1 != a_1 + 2)
                a_2 += 2;

            if (a_1 == a_2 && b_1 == b_2)
                break;
            else {
                a_1 = a_2;
                b_1 = b_2;
            }
        }
    }
    
    if (a_1 == c && b_1 == d)
        printf("Yes\n");
    else
        printf("No\n");

    return 0;
}