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# (Mono 4.6.2.0) (judge verdict: Accepted)

using System;
using System.Linq;
using System.Collections.Generic;

class Mondai
{
    static void Main()
    {
        var line = Console.ReadLine().Split(' ').Select(x => Int32.Parse(x)).ToArray();
        var N = line[0];
        var A = line[1];
        var B = line[2];
        var C = line[3];
        var D = line[4];
        var S = Console.ReadLine().ToCharArray();
        var isGyaku = false;
        var startGyaku = 0;
        var endGyaku = N - 1;
        if (A< B && D < C)
        {
            isGyaku = true;
            startGyaku = Math.Max(A,B);
            endGyaku = Math.Min(C,D);
        }
        var isNotKasanari = false;
        var notKasanariStart = 0;
        var notKasanariEnd = 0;
        if (C < B)
        {
            isNotKasanari = true;
            notKasanariStart = C-1;
            notKasanariEnd = B-1;
        }
        var start = Math.Min(A,B);
        var end = Math.Max(C,D);
        var ans = "Yes";
        var canGyaku = false;
        for (int i=1;i<N;++i)
        {
            if (isNotKasanari)
            {
                if (notKasanariStart < i && i < notKasanariEnd) continue;
            }
            if (start-1<i && i < end)
            {
                if (S[i-1]=='#' && S[i] == '#')
                {
                    ans = "No";
                    break;
                }
            }
            if (isGyaku && !canGyaku)
            {
                if (startGyaku-2 < i && i < endGyaku)
                {
                    if (i<N-1 && S[i-1] == '.' && S[i] == '.' && S[i + 1] == '.')
                    {
                        canGyaku = true;
                    }
                }
            }
        }
        if (isGyaku)
        {
            if (canGyaku == false) ans = "No";
        }
        Console.WriteLine(ans);
    }
}