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.Collections.Generic;
using System.Linq;

public class Solution
{
    static bool[] GetVisited(string way, int start, int goal)
    {
        var n = way.Length;
        var points = new HashSet<int>();
        var visited = new bool[n];
        var result = new bool[n];
        visited[start] = true;
        for (int i = start; i <= goal; i++)
        {
            if (visited[i])
            {
                for (int j = i + 1; j <= i + 2 && j < n; j++)
                {
                    if (way[j] == '.')
                    {
                        visited[j] = true;
                    }
                }
            }
        }
        result[goal] = visited[goal];
        for (int i = goal; i >= start; i--)
        {
            if (result[i])
            {
                for (int j = i - 1; j >= i - 2 && j >= 0; j--)
                {
                    result[j] = visited[j];
                }
            }
        }
        return result;
    }

    public static void Main()
    {
        var vals = Console.ReadLine().Split(' ').Select(int.Parse).ToArray();
        var N = vals[0];
        var A = vals[1] - 1;
        var B = vals[2] - 1;
        var C = vals[3] - 1;
        var D = vals[4] - 1;
        var S = Console.ReadLine();

        var aVisited = GetVisited(S, A, C);
        var bVisited = GetVisited(S, B, D);
        bool ok = false;
        if (C < D)
        {
            ok = aVisited[C] && bVisited[D];
        }
        else
        {
            for (int i = 0; i < N - 2; i++)
            {
                if (aVisited[i] && bVisited[i + 1] && aVisited[i + 2])
                {
                    ok = true;
                    break;
                }
            }
        }

        Console.WriteLine(ok ? "Yes" : "No");
    }
}