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 (GCC 5.4.1) (judge verdict: Wrong Answer)

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

char str[200001];
long long  n;

int move1(int a, int b, int c, int d)
{
    if( a == c && b == d )
    {
        puts("Yes");
        exit(0);
    }

    if( a < b && c < d )
    {
        if( strstr(&str[a], "###") == NULL ) return 1;
        else return 0;
    }

    if( b < a && d < c )
    {
        if( strstr(&str[b], "###") == NULL ) return 1;
        else return 0;
    }

    if( a < b )
    {
        // a + 2
        if( a + 2 < n && str[a+2] == '.' )
        {
            str[a]   = '.';
            str[a+2] = 'A';
            if( move1(a+2, b, c, d) == 1 ) return 1;
        }
        // a + 1
        if( a + 1 < n && str[a+1] == '.' )
        {
            str[a]   = '.';
            str[a+1] = 'A';
            if( move1(a+1, b, c, d) == 1 ) return 1;
        }
        // b + 1
        if( b + 1 < n && str[b+1] == '.' )
        {
            str[b]   = '.';
            str[b+1] = 'B';
            if( move1(a, b+1, c, d) == 1 ) return 1;
        }
        // b + 2
        if( b + 2 < n && str[b+2] == '.' )
        {
            str[b]   = '.';
            str[b+2] = 'B';
            if( move1(a, b+2, c, d) == 1 ) return 1;
        }
    }
    else
    {
        // b + 2
        if( b + 2 < n && str[b+2] == '.' )
        {
            str[b]   = '.';
            str[b+2] = 'B';
            if( move1(a, b+2, c, d) == 1 ) return 1;
        }
        // b + 1
        if( b + 1 < n && str[b+1] == '.' )
        {
            str[b]   = '.';
            str[b+1] = 'B';
            if( move1(a, b+1, c, d) == 1 ) return 1;
        }
        // a + 1
        if( a + 1 < n && str[a+1] == '.' )
        {
            str[a]   = '.';
            str[a+1] = 'A';
            if( move1(a+1, b, c, d) == 1 ) return 1;
        }
        // a + 2
        if( a + 2 < n && str[a+2] == '.' )
        {
            str[a]   = '.';
            str[a+2] = 'A';
            if( move1(a+2, b, c, d) == 1 ) return 1;
        }
    }

    return 0;
}

int main(int argc, void **arg)
{
    long long a, b, c, d;
    int ret;

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

    str[a-1] = 'A';
    str[b-1] = 'B';

    ret = move1(a-1, b-1, c-1, d-1);

    if( ret == 1 )
    {
        puts("Yes");
    }
    else
    {
        puts("No");
    }

    return 0;
}