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: Runtime Error)

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;

namespace AGC034A
{
    class Program
    {
        static void Main(string[] args)
        {
            string[] input = Console.ReadLine().Split();
            int N = int.Parse(input[0]);
            int A = int.Parse(input[1]);
            int B = int.Parse(input[2]);
            int C = int.Parse(input[3]);
            int D = int.Parse(input[4]);

            string S = Console.ReadLine();
            bool check = true;
            bool wide = false;
            //岩が連続して２つ置かれている時は進めない
            for (int i = A; i < Math.Min(D,C) - 2; i++)
            {
                if (S.Substring(i, 1) == "#" && S.Substring(i + 1, 1) == "#")
                {
                    check = false;
                    break;
                }
            }
            //３つ連続してスペースがある時、追い抜ける
            for (int i = B; i < D - 3; i++)
            {
                if (S.Substring(i, 1) == "." && S.Substring(i + 1, 1) == "." && S.Substring(i + 2, 1) == ".")
                {
                    wide = true;
                }

            }
            //Bの左横と右横がスペースなら追い抜ける
            if (S.Substring(B, 1) == "."&&S.Substring(B-2,1)==".")
            {
                wide = true;
            }
            //Bの右側にスペースが２つあれば、追い抜ける
            if (S.Substring(B,1)=="."&&S.Substring(B+1,1)==".")
            {
                wide = true;
            }
            //Dの左右にスペースがあるなら、追い抜ける
            if (S.Substring(D,1)=="."&&S.Substring(D-2,1)==".")
            {
                wide = true;
            }
            if (D < C && S.Substring(D - 2, 1) == "#")
            {
                if (wide == true)
                {
                    check = true;
                }
                else
                {
                    check = false;
                }
            }
            if (check == false)
            {
                Console.WriteLine("No");
            }
            else
            {
                Console.WriteLine("Yes");
            }
        }
    }
}