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.Text.RegularExpressions;
using System.Threading.Tasks;
using System.Collections;
static class Extensions
{
    public static int ToInt(this string s) => int.Parse(s);
    public static long ToLong(this string s) => long.Parse(s);
    public static char ToChar(this string s) => char.Parse(s);
    public static double ToDouble(this string s) => double.Parse(s);
    public static int[] ToIntArray(this string s) => s.Replace(',', ' ').Split(' ').Select(x => x.ToInt()).ToArray();
    public static long[] ToLongArray(this string s) => s.Replace(',', ' ').Split(' ').Select(x => x.ToLong()).ToArray();
    public static double[] ToDoubleArray(this string s) => s.Replace(',', ' ').Split(' ').Select(x => x.ToDouble()).ToArray();
}

class Program
{
    static string[] ReadLines(int n) => Enumerable.Range(0, n).Select(s => Console.ReadLine()).ToArray();

    static void Main()
    {
        int[] nabcd = Console.ReadLine().ToIntArray();
        int N = nabcd[0];
        int A = nabcd[1] - 1;
        int B = nabcd[2] - 1;
        int C = nabcd[3] - 1;
        int D = nabcd[4] - 1;


        int a = A;
        int b = B;

        string S = Console.ReadLine();
        Func<int, bool> isEmpty = n =>
        {
            return (S[n] != '#' && a != n && b != n);
        };

        if (C < D)
        {
            //BをDにうつ移す
            //これは、BからDまでに#が2連続の箇所がなければ可能
            if (S.Substring(B, D - B + 1).Contains("##"))
            {
                Console.WriteLine("No");
                return;
            }
            b = D;

            //次にAをCに移す
            //これは、AからCまでに#が2連続の箇所がなければ可能
            if (S.Substring(A, C - A + 1).Contains("##"))
            {
                Console.WriteLine("No");
                return;
            }

            Console.WriteLine("Yes");
            return;
        }
        else
        {
            
            if (S.Substring(B, D - B + 1).Contains("##"))
            {
                Console.WriteLine("No");
                return;
            }

            //次にAをCに移す
            //これは、AからCまでに#が2連続の箇所がなければ可能
            if (S.Substring(A, C - A + 1).Contains("##"))
            {
                Console.WriteLine("No");
                return;
            }

            //AがBを追い抜けるか
            if ((S[B - 1] == '.' && S[B + 1] == '.')
                || (S[B + 1] == '.' && S[B + 2] == '.')
                || (S.Substring(B, D - B + 1).Contains("..."))
                || (S[D - 1] == '.' && S[D + 1] == '.'))
            {
                Console.WriteLine("Yes");
                return;
            }

            Console.WriteLine("No");
            return;
        }
    }
}