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: Time Limit Exceeded)

using System;
using System.Linq;
using System.Collections.Generic;

namespace agc030_a
{
    class Program
    {
        static void Main(string[] args)
        {
            var text = Console.ReadLine();
            var list = text.Split(' ').Select(x => int.Parse(x)).ToList();

            var s = list[0];
            var a = list[1];
            var b = list[2];
            var c = list[3];
            var d = list[4];

            text = Console.ReadLine();

            var numbers = new List<int>();
            for(int i = 0; i < text.Length; i++){
                var item = text.Substring(i, 1);
                if (item == "#")
                {
                    numbers.Add(1);
                }
                else
                {
                    numbers.Add(0);
                }
            }

            if (c > d){
                var isFind = false;
                for(int move = b; move < d; move++){
                    var item = numbers[move - 1];
                    if (item == 1){
                        continue;
                    }

                    var reptext = text.Substring(0, move - 1) + "#" + text.Substring(move, text.Length - move - 1);
                    var subtext = reptext.Substring(a, d - a - 1);
                    var alen = subtext.Length;
                    var blen = subtext.Replace("..", "").Length;
                    var clen = subtext.Replace("##", "").Length;
                    if ((alen != blen) && (alen == clen)){
                        isFind = true;
                        break;
                    }
                }

                if (isFind == false){
                    Console.WriteLine("No");
                    return;
                }
            }

            while(true)
            {
                var limit = Math.Min(2, d - b);
                var step1 = numbers[b];
 
                if (limit == 1){
                    if (step1 == 0){
                        b++;
                    }
                    else{
                        break;
                    }
                } else {
                   var step2 = numbers[b + 1];
                   if (step2 == 0)
                    {
                        b++;
                        b++;
                    }
                    else if (step1 == 0){
                        b++;
                    } else {
                        break;
                    }
                }

                if (b == d)
                {
                    break;
                }
            }

            if (b != d){
                Console.WriteLine("No");
                return;
            }

            while(true)
            {
                var limit = Math.Min(2, c - a);
                var step1 = numbers[a];

                if (limit == 1){
                    if (step1 == 0){
                        a++;
                    }
                    else{
                        break;
                    }
                } else {
                    var step2 = numbers[a + 1];
                    if (step2 == 0)
                    {
                        a++;
                        a++;
                    }
                    else if (step1 == 0){
                        a++;
                    } else {
                        break;
                    }
                }

                if (a == c)
                {
                    break;
                }
            }

            if (a != c){
                Console.WriteLine("No");
                return;
            }

            Console.WriteLine("Yes");
        }
    }
}