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;
class Program
{
	static void Main(string[] args)
	{
		// スペース区切りの整数の入力
		string[] input = Console.ReadLine().Split(' ');
		int sellNumber = int.Parse(input[0]);
		int snkStart = int.Parse(input[1]) -1;
		int fnkStart = int.Parse(input[2]) -1;
		int snkGoal = int.Parse(input[3]) -1;
		int fnkGoal = int.Parse(input[4]) -1;
		int[] field = new int[sellNumber];
		string fieldState = Console.ReadLine();
		
		for (int i = 0; i < fieldState.Length; i++)
		{
		    field[i] = fieldState[i] == '.' ? 0 : 1;
		}
		
		if (basicCondition(field, snkStart, fnkStart, snkGoal, fnkGoal) == false) {
		    Console.WriteLine("No");
		    return;
		}
		
		if (noRockPair(field, snkStart, snkGoal) == false) {
		    Console.WriteLine("No");
		    return;
		}
		
		if (noRockPair(field, fnkStart, fnkGoal) == false) {
		    Console.WriteLine("No");
		    return;
		}
		
		// fnkGoal が snkGoal よりも index が大きければ、ここまでで攻略可能であることが確定。
		if (fnkGoal > snkGoal) {
		    Console.WriteLine("Yes");
		    return;
		}
		
		// snkGoal が fnkGoal よりも index が大きい場合、
		// 空きマスが３連続していることが必要十分（どこかで２人の位置を入れ替える必要がある）
		if (tryVoid(field)) {
		    Console.WriteLine("Yes");
		    return;
		}
		Console.WriteLine("No");
	}
	
	// いずれかのスタートかゴールに岩が置かれている場合、問題外なので false
	static bool basicCondition(int[] field, int ss, int fs, int sg, int fg)
	{
	    if (field[ss] == 1) return false;
	    if (field[fs] == 1) return false;
	    if (field[sg] == 1) return false;
	    if (field[fg] == 1) return false;
	    return true;
	}
	
	// start から goal の間に連続する岩がないことを判定する
	static bool noRockPair(int[] field, int fs, int fg){
	    for (int i = fs + 2; i < fg; i++)
	    {
	        if (field[i] * field[i-1] == 1) {
	            return false;
	        }
	    }
	    return true;
	}
	
	// 空きマスが３連続しているかを判定
	static bool tryVoid(int[] field) {
	    for (int i = 2; i < field.Length; i++)
	    {
	        if (field[i] + field[i-1] + field[i-2] == 0) {
	            return true;
	        }
	    }
	    return false;
	}
}