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;

namespace A_AGC034
{
    class MainClass
    {

        static int[] u;

        public static void Main(string[] args)
        {
            u = Array.ConvertAll(Console.ReadLine().Split().ToArray(), int.Parse);
            string s = Console.ReadLine();

            int a = u[1] - 1;
            int b = u[2] - 1;
            int c = u[3] - 1;
            int d = u[4] - 1;
            int n = u[0];

            if (c < d)
            {
                for (int i = a; i < d - 1; i++)
                {
                    if (s[i] == '#' && s[i + 1] == '#')
                    {
                        Console.WriteLine("No");
                        return;
                    }
                }
                Console.WriteLine("Yes");
                return;
            }
            else
            {
                bool hasjump = false;
                for (int i = b - 1; i < c - 1; i++)
                {

                    if (!hasjump && i < d - 1)
                    {
                        if (s[i - 1] == '.' && s[i] == '.' && s[i + 1] == '.')
                        {
                            hasjump = true;
                        }
                    }

                    if (s[i] == '#' && s[i + 1] == '#')
                    {
                        Console.WriteLine("No");
                        return;
                    }
                }
                if (hasjump)
                {
                    Console.WriteLine("Yes");
                    return;
                }
                else
                {
                    Console.WriteLine("No");
                    return;
                }



            }

        }
    }
}