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: Wrong Answer)

using System;
using System.Linq;
class c
{
    static void Main()
    {
        var inp = Array.ConvertAll(Console.ReadLine().Split(), int.Parse);
        int n = inp[0], a = inp[1], b = inp[2], c = inp[3], d = inp[4];
        var s = Console.ReadLine();
        bool judge = true;
        var sunuke = new int[n + 2];
        var funuke = new int[n + 2];
        sunuke[a] = 1;
        if (s[(a - 1) + 1] == '.') sunuke[a + 1] = 1;
        if (a > 1 && s[(a - 1) - 1] == '.') sunuke[a - 1] = 1;
        funuke[b] = 1;
        if (s[(b - 1) + 1] == '.') funuke[b + 1] = 1;
        if (b > 1 && s[(b - 1) - 1] == '.') funuke[b - 1] = 1;
        for (int i = a + 2; i < c + 1; i++)
        {
            if (s[i - 1] == '.')
            {
                if (sunuke[i - 1] > 0) sunuke[i]++;
                if (sunuke[i - 2] > 0) sunuke[i]++;
            }
        }
        for (int i = b + 2; i <= d + 1; i++)
        {
            if (i <= n && s[i - 1] == '.')
            {
                if (funuke[i - 1] > 0) funuke[i]++;
                if (funuke[i - 2] > 0) funuke[i]++;
            }
        }
        if (sunuke[c] == 0) judge = false;
        if (funuke[d] == 0) judge = false;
        if (c > d && !funuke.Contains(2)) judge = false;
        Console.WriteLine(judge ? "Yes" : "No");
    }
}