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.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;

namespace AGC034
{
    class A
    {
        static void Main(string[] args)
        {
            int[] a = Console.ReadLine().Split(' ').Select(o => int.Parse(o)).ToArray();
            int N = a[0], A = a[1]-1, B = a[2]-1, C = a[3]-1, D = a[4]-1;
            string S = Console.ReadLine();

            string r = "No";
            if (C < D)
            {
                if (Judge(S, B, D) && Judge(S, A, C)) r = "Yes";
            }
            else
            {
                if (Judge(S, B, D) && Judge(S, A, C))
                {

                    int s = B - 1;
                    int e = D + 1;

                    for (int i = s + 2; i <= e; i++)
                    {
                        if (S[i] == '.' && S[i - 1] == '.' && S[i - 2] == '.')
                        {
                            r = "Yes";
                            break;
                        }
                    }

                }

            }
            Console.WriteLine(r);
        }

        static bool Judge(string S, int start, int end)
        {

            for(int i = start+1; i < end; i++)
            {
                if (S[i] == '#' && S[i - 1] == '#') return false;
            }
            return true;
        }

       
    }
}