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;
using System.Collections.Generic;
using System.Linq;
using System.Text;

class TEST{
	static void Main(){
		Sol mySol =new Sol();
		mySol.Solve();
	}
}

class Sol{
	public void Solve(){
		
		bool[] NA = new bool[N];
		for(int i=0;i<N;i++){
			if(S[i] == '#') NA[i] = true;
			if(i + 1 < N && S[i + 1] == '#') NA[i] = true;
			if(i - 1 >= 0 && S[i - 1] == '#') NA[i] = true;
		}
		
		bool chk = false;
		for(int i=A;i<C;i++){
			if(i + 1 < N && S[i + 1] == '.') continue;
			if(i + 2 < N && S[i + 2] == '.') continue;
			chk = true;
			break;
		}
		if(chk){
			Console.WriteLine("No");
			return;
		}
		
		chk = false;
		for(int i=B;i<D;i++){
			if(i + 1 < N && S[i + 1] == '.') continue;
			if(i + 2 < N && S[i + 2] == '.') continue;
			chk = true;
			break;
		}
		if(chk){
			Console.WriteLine("No");
			return;
		}		
		
		if(C <= B || D <= A){
			Console.WriteLine("Yes");
			return;
		}
		
		if(D > C){
			Console.WriteLine("Yes");
			return;
		}
		
		chk = false;
		for(int i=B;i<=D;i++){
			if(NA[i] == false) chk = true;
		}
		Console.WriteLine(chk ? "Yes" : "No");
		
		
	}
	int N,A,B,C,D;
	String S;
	public Sol(){
		var d = ria();
		N = d[0]; A = d[1] - 1; B = d[2] - 1; C = d[3] - 1; D = d[4] - 1;
		S = rs();
	}

	static String rs(){return Console.ReadLine();}
	static int ri(){return int.Parse(Console.ReadLine());}
	static long rl(){return long.Parse(Console.ReadLine());}
	static double rd(){return double.Parse(Console.ReadLine());}
	static String[] rsa(char sep=' '){return Console.ReadLine().Split(sep);}
	static int[] ria(char sep=' '){return Array.ConvertAll(Console.ReadLine().Split(sep),e=>int.Parse(e));}
	static long[] rla(char sep=' '){return Array.ConvertAll(Console.ReadLine().Split(sep),e=>long.Parse(e));}
	static double[] rda(char sep=' '){return Array.ConvertAll(Console.ReadLine().Split(sep),e=>double.Parse(e));}
}