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.IO;
using System.Linq;
using System.Numerics;
using System.Collections.Generic;
using System.Text;
using System.Text.RegularExpressions;
using System.Threading.Tasks;
using static System.Math;
using Debug = System.Diagnostics.Debug;

static class P
{
    static void Main()
    {
        var nabcd = Console.ReadLine().Split().Select(int.Parse).ToArray();
        var n = nabcd[0];
        var a = nabcd[1];
        var b = nabcd[2];
        var c = nabcd[3];
        var d = nabcd[4];
        string s = Console.ReadLine();
        //確実に踏まなければいけない場所
        //abcd
        //acbd
        if (a < b && b < c && c < d || a < c && c < b && b < d)
        {
            if (!s.Substring(a - 1, c - a + 1).Contains("##") && !s.Substring(b - 1, d - b + 1).Contains("##"))
            {
                Console.WriteLine("Yes");
            }
            else
            {
                Console.WriteLine("No");
            }
        }
        //abdc
        else if (a < b && b < d && d < c)
        {
            if (!s.Substring(a - 1, c - a + 1).Contains("##") && !s.Substring(b - 1, d - b + 1).Contains("##") && s.Substring(b - 2, (d + 1) - b + 1).Contains("..."))
            {
                Console.WriteLine("Yes");
              
                throw new Exception();
            }
            else
            {
                Console.WriteLine("No");
            }
        }
        else
        {
            throw new Exception();
        }
    }
}