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;
using System.Text;
using System.Threading.Tasks;

namespace ConsoleApp15
{
    class Class332
    {
        static int[] jump = new int[2] { 1, 2 };
        static void Main()
        {
            var h = Console.ReadLine().Split().Select(int.Parse).ToArray();
            int N = h[0], A = h[1]-1, B = h[2]-1, C = h[3]-1, D = h[4]-1;
            string S = Console.ReadLine();
            bool[] ta = new bool[N];
            bool[] tb = new bool[N];

            var que = new Queue<int>();
            que.Enqueue(A);
            while (que.Count > 0)
            {
                var t = que.Dequeue();
                ta[t] = true;
                for(int i = 0; i < 2; i++)
                {
                    int nx = t + jump[i];
                    if (nx <=C)
                    {
                        if (S[nx] == '.'&&ta[nx] == false)
                        {
                            que.Enqueue(nx);
                        }
                    }
                }
            }
            que = new Queue<int>();
            que.Enqueue(B);
            while (que.Count > 0)
            {
                var t = que.Dequeue();
                tb[t] = true;
                for(int i = 0; i < 2; i++)
                {
                    int nx = t + jump[i];
                    if (nx <=D)
                    {
                        if (S[nx] == '.'&&tb[nx] == false)
                        {
                            que.Enqueue(nx);
                        }
                    }
                }
            }

            if ((A < B && D < C) || (B < A && C < D))
            {
                bool c = false;
                for (int i = 0; i < N - 2; i++)
                {
                    if ((ta[i] && ta[i + 1] && ta[i + 2]&&tb[i+1])||(tb[i]&&tb[i+1]&&tb[i+2]&&ta[i+1]))
                    {
                        c = true;
                    }
                }
                Console.WriteLine((ta[C] && tb[D] && c) ? "Yes" : "No");
            }
            else
            {
                Console.WriteLine((ta[C] && tb[D]) ? "Yes" : "No");
            }
        }
    }
}