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: Wrong Answer)

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;

class Program
{
    bool Run()
    {
        var sc = new Scanner();
        int n = sc.NextInt();
        int a = sc.NextInt() - 1;
        int b = sc.NextInt() - 1;
        int c = sc.NextInt() - 1;
        int d = sc.NextInt() - 1;
        string s = sc.NextString();

        bool sp = false;
        for (int i = b; i < Math.Min(d, n); i++)
        {
            if (s[i - 1] == '.' && s[i] == '.' && s[i + 1] == '.') sp = true;
        }

        if (c > d && !sp) return false;

        int q = b;
        while (q < d)
        {
            if (q + 1 < n && s[q + 1] == '.')
            {
                q += 1;
                continue;
            }
            if (q + 2 < n && s[q + 2] == '.')
            {
                q += 2;
                continue;
            }
            return false;
        }
        if (q != d) return false;

        int p = a;
        while (p < c)
        {
            if (p + 1 < n && s[p + 1] == '.')
            {
                p += 1;
                continue;
            }
            if (p + 2 < n && s[p + 2] == '.')
            {
                p += 2;
                continue;
            }
            return false;
        }
        if (p != c) return false;

        return true;
    }

    static void Main(string[] args)
    {
        Console.WriteLine(new Program().Run() ? "Yes" : "No");
    }

    static long Gcd(long a, long b)

    {
        if (a < b) return Gcd(b, a);
        if (b == 0) return a;
        return Gcd(b, a % b);
    }
}

class Scanner
{
    int index = -1;
    string[] buf;

    public Scanner()
    {
    }

    public int NextInt()
    {
        CheckNext();
        return int.Parse(buf[index++]);
    }

    public long NextLong()
    {
        CheckNext();
        return long.Parse(buf[index++]);
    }

    public double NextDouble()
    {
        CheckNext();
        return double.Parse(buf[index++]);
    }

    public string NextString()
    {
        CheckNext();
        return buf[index++];
    }

    private void CheckNext()
    {
        if (index >= 0 && index < buf.Length) return;

        buf = Console.ReadLine().Split(' ');
        index = 0;
    }
}