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 (GCC 5.4.1) (judge verdict: Wrong Answer)

#include<stdio.h>
#include<string.h>

int main(){
	int N,A,B,C,D;
	char S[200001];
	int min,max,fin,start;
	int i;
	int cross;
	scanf("%d %d %d %d %d",&N,&A,&B,&C,&D);
	scanf("%s",&S);
	if(A<B){
		min=A-1;
		start=B-1;
	}
	else{
		min =B-1;
		start= A-1;
	}
	if(C>D){
		max=C-1;
		fin=D-1;
	}
	else{
		max = D-1;
		fin =C-1;
	}
	if(A>B&&C>D || B>A&& D>C)cross=0;
	else cross = 1;
	
	for(i=min;i<max;i++){
		if(S[i]=='#'&&S[i+1]=='#'){
			printf("No\n");
			return 0;
			break;
		}
	}
	if(cross==0){
		printf("Yes\n");
	}
	if(cross == 1){
		for(i=start;i<fin;i++){
		if(i<fin-1&&S[i]=='.'&&S[i+1]=='.'&&S[i+2]=='.'){
			printf("Yes\n");
			return 0;
		}
		}
		if(S[fin-1]=='.' && S[fin+1]=='.' && fin+1!=max){
			printf("Yes\n");
		}
		else printf("No\n");
	}
	return 0;
}