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;

namespace Algorithm
{
    class Program
    {
        static void Main(string[] args)
        {
            var l = Console.ReadLine().Split().Select(int.Parse).ToArray();
            int N = l[0], A = l[1], B = l[2], C = l[3], D = l[4];

            var array = Console.ReadLine().ToCharArray();
            var lastB = D;

            for (var i = B; i < D; i++)
            {
                if (array[i - 2] == '.' && array[i] == '.')
                {
                    lastB = i;
                    break;
                }

                var tmp = Judge(array, i, 'B');
                if (tmp >= 0)
                    i += tmp;
                else
                    return;
            }

            for (var i = A; i < C; i++)
            {
                var tmp = Judge(array, i, 'A');
                if (tmp >= 0)
                    i += tmp;
                else
                    return;
            }

            for (var i = lastB; i < D; i++)
            {
                var tmp = Judge(array, i, 'B');
                if (tmp >= 0)
                    i += tmp;
                else
                    return;
            }

            Console.WriteLine("Yes");
        }

        static int Judge (char[] array, int ind, char word)
        {

            if (array[ind] == '.')
            {
                array[ind - 1] = '.';
                array[ind] = word;
                return 0;
            }
            else if (array[ind + 1] == '.')
            {
                array[ind - 1] = '.';
                array[ind + 1] = word;
                return 1;
            }
            else
            {
                Console.WriteLine("No");
                return -1;
            }
        }
    }
}