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;
class Program
{
	static void Main(string[] args)
	{
		string[] str = Console.ReadLine().Split();
		int N = int.Parse(str[0]);
		int A = int.Parse(str[1]);
		int B = int.Parse(str[2]);
		int C = int.Parse(str[3]);
		int D = int.Parse(str[4]);
		string s = Console.ReadLine();
		var list = new List<int>();
		list.Add(B);
		int[]E = new int[N+1];
		bool flag = false;
		while(list.Count>0){
			var list2 = new List<int>(list);
			list.Clear();
			foreach(var h in list2){
				if(h+1<=N && E[h+1]==0){
					if(s.Substring(h+1-1,1)=="."){
						list.Add(h+1);
						E[h+1] = 1;
						if(h+1==D){
							flag = true;
							break;
						}
					}
				}
				if(h+2<=N && E[h+2]==0){
					if(s.Substring(h+2-1,1)=="."){
						list.Add(h+2);
						E[h+2] = 1;
						if(h+2==D){
							flag = true;
							break;
						}
					}
				}
			}
		}
		if(flag){
			flag = false;
			list.Clear();
			list.Add(A);
			int[]E2 = new int[N+1];
		while(list.Count>0){
			var list2 = new List<int>(list);
			list.Clear();
			foreach(var h in list2){
				if(h+1<=N && E2[h+1]==0){
					if(s.Substring(h+1-1,1)=="."){
						list.Add(h+1);
						E2[h+1] = 1;
						if(h+1==C){
							flag = true;
							break;
						}
					}
				}
				if(h+2<=N && E2[h+2]==0){
					if(s.Substring(h+2-1,1)=="."){
						list.Add(h+2);
						E2[h+2] = 1;
						if(h+2==C){
							flag = true;
							break;
						}
					}
				}
			}
		}
		}
		if(flag){
			if(C>D){
				flag = false;
				for(var i=B-1;i<=D-3;i++){
					if(s.Substring(i,1)=="." && s.Substring(i+1,1)=="." && s.Substring(i+2,1)=="."){
						flag = true;
						break;
					}
				}
			}
		}
		string ans = "No";
		if(flag){
			ans = "Yes";
		}
		Console.WriteLine(ans);
	}
}