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 static System.Console;
using System.Runtime.CompilerServices;
using static MyUtil;
using System.Collections;

class MyUtil
{
    public static int[] ReadIntArray()
    {
	return ReadLine().Split().Select(x => int.Parse(x)).ToArray();
    }
}

class Program
{
    static string s;
    
    static bool CanReach(int l, int r)
    {
	for (int i = l; i < r; i++)
	{
	    if (s[i] == '#' && s[i+1] == '#') return false;
	}
	return true;
    }
    
    public static void Main()
    {
	var tmp = ReadIntArray();
	int n = tmp[0], a = tmp[1], b = tmp[2], c = tmp[3], d = tmp[4];
	s = "#" + ReadLine() + "#";

	if (!CanReach(a, c) || !CanReach(b, d))
	{
	    WriteLine("No");
	    return;
	}

	if (c > d)
	{
	    bool can_overtake = false;
	    for (int i = b; i <= d; i++)
	    {
		if (s[i-1] == '.' && s[i] == '.' && s[i+1] == '.')
		{
		    can_overtake = true;
		    break;
		}
	    }

	    WriteLine(can_overtake ? "Yes" : "No");
	    return;
	}
	
	WriteLine("Yes");
    }
}