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

namespace A
{
    class Program
    {
        static void Main(string[] args)
        {
            string[] str = Console.ReadLine().Split(' ');
            int N = int.Parse(str[0]);
            int A = int.Parse(str[1]);
            int B = int.Parse(str[2]);
            int C = int.Parse(str[3]);
            int D = int.Parse(str[4]);
            string S = Console.ReadLine();
            string result="Yes";

            if (C < D)//すぬけとふぬけが入れ替わらない場合
            {
                if (S.Substring(A-1,D-A+1).Contains("##"))
                {
                    result = "No";
                }

                if (S.Substring(C - 1, 1) == "#"/*&&S.Substring(B,1)=="#"*/)
                {
                    result = "No";
                }

                //for (int i = A; i < D; i++)
                //{
                //    string a = S.Substring(i - 1,2);
                //    if (a == "##")
                //    {
                //        result = "No";
                //        break;
                //    }

                //}
            }
            else
            {
                if (S.Substring(A-1, C - A+1).Contains("##")|| (!S.Contains("...")))
                {
                    result = "No";
                }

                if (S.Substring(D - 1, 1) == "#"/*&&S.Substring(B, 1) == "#"*/)
                {
                    result = "No";
                }

                //for (int i = A; i < D; i++)
                //{
                //    string a = S.Substring(i - 1, 2);
                //    if (a == "##")
                //    {
                //        result = "No";
                //        break;
                //    }
                //    if (!S.Contains("..."))
                //    {
                //        result = "No";
                //        break;
                //    }
                //}
            }

            Console.Write(result);
        }
    }
}