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: Accepted)

using System;
using System.Linq;
using System.Collections.Generic;
using static System.Console;
using System.Text;
using System.IO;
using static System.Math;
namespace AtCoder
{
    class Program
    {
        static public long[] Sarray() { return ReadLine().Split().Select(long.Parse).ToArray(); }
        static public List<long> Slist() { return ReadLine().Split().Select(long.Parse).ToList(); }

        static void Main(string[] args)
        {
            //SetOut(new StreamWriter(OpenStandardOutput()) { AutoFlush = false });
            var NABCD = Sarray();
            var N = NABCD[0];
            var A = NABCD[1] - 1;
            var B = NABCD[2] - 1;
            var C = NABCD[3] - 1;
            var D = NABCD[4] - 1;
            var S = ReadLine();
            //A-C間、B-D間に岩が二つある
            for (var i = A; i <= C; ++i)
            {
                if (S[(int)i] == '#' && S[(int)i + 1] == '#')
                {
                    WriteLine("No");
                    return;
                }
            }
            for (var i = B; i <= D; ++i)
            {
                if (S[(int)i] == '#' && S[(int)i + 1] == '#')
                {
                    WriteLine("No");
                    return;
                }
            }
            //D<Cでかつ3連続する空白がない(すぬけとふぬけがすれ違えない)
            if (D < C)
            {
                //右にしか動けないのでB-1～D間に空白が三つ必要
                var have3 = false;
                for (var i = B - 1; i < D; ++i)
                {
                    if (S[(int)i] == '.' && S[(int)i + 1] == '.' && S[(int)i + 2] == '.')
                        have3 = true;
                }
                if (!have3)
                {
                    WriteLine("No");
                    return;
                }
            }
            WriteLine("Yes");
            //Out.Flush();
        }
    }
}