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;

static class CodeJam
{
    static int Max(string S, char C, int a, int b)
    {
        int max = 0;
        int cnt = 0;
        for (int i = a; i <= b; ++i)
        {
            cnt = (S[i] == C) ? (cnt + 1) : 0;
            max = Math.Max(cnt, max);
        }
        return max;
    }

    static bool Solve(int N, int A, int B, int C, int D, string S)
    {
        if (Max(S, '#', A, C) >= 2) { return false; }
        if (Max(S, '#', B, D) >= 2) { return false; }
        if (A < B && D < C)
        {
            if (S[B - 1] != '#' && S[B + 1] != '#') { return true; }
            if (S[D - 1] != '#' && S[D + 1] != '#') { return true; }
            if (Max(S, '.', B, D) < 3) { return false; }
        }
        else if (B < A && C < D)
        {
            if (S[A - 1] != '#' && S[A + 1] != '#') { return true; }
            if (S[C - 1] != '#' && S[C + 1] != '#') { return true; }
            if (Max(S, '.', A, C) < 3) { return false; }
        }
        return true;
    }

    static void Main(string[] args)
    {
        var V = Array.ConvertAll(Console.ReadLine().Split(), int.Parse);
        string S = Console.ReadLine();
        Console.WriteLine(Solve(V[0], V[1] - 1, V[2] - 1, V[3] - 1, V[4] - 1, S) ? "Yes" : "No");
    }
}