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 <stdlib.h>



int main(){

	int i, j, A, B, C, D, N, B_kari = -10, flag;
	char *S;




	scanf("%d %d %d %d %d", &N, &A, &B, &C, &D);

	S = (char *)malloc(N * sizeof(char));

	scanf("%s", S);


	if (C < D){
		while (1){
			if (B + 1 < N && S[B + 1] == '.' && B + 1 < D){
				B += 2;
			}
			else if (B < N && S[B] == '.'){
				B++;
			}
			else{
				printf("No\n");
				return 0;
			}
			if (B == D)
				break;
		}

		while (1){
			if (A + 1 < N && S[A + 1] == '.' && A + 1 < D){
				A += 2;
			}
			else if (A < N && S[A] == '.'){
				A++;
			}
			else{
				printf("No\n");
				return 0;
			}
			if (A == C)
				break;
		}

		printf("Yes\n");
		return 0;

	}
	else{
		flag = 0;
		for (i = B - 2; i < D + 1; i++){
			if (S[i] == '.'){
				flag++;
			}
			else{
				flag = 0;
			}
			if (flag == 3){
//				printf("aaaaaaaaaaa %d\n", i);
				B_kari = i;
				break;
			}
		}

		if (B_kari < 0){
			printf("No\n");
			return 0;
		}

		while (1){
			if (B + 1 < N && S[B + 1] == '.' && B + 1 < B_kari){
				B += 2;
			}
			else if (B < N && S[B] == '.' ){
				B++;
			}
			else{
				printf("No\n");
				return 0;
			}
			if (B == B_kari){
				S[B - 1] = '#';
	//			printf("%s %d\n", S, B);
				break;
			}

		}

		while (1){
			if (A + 1 < N && S[A + 1] == '.' && A + 1 < C){
				A += 2;
			}
			else if (A < N && S[A] == '.'){
				A++;
			}
			else{
				printf("No\n");
				return 0;
			}
			if (A == C)
				break;
		}

		if (B == D){
			printf("Yes\n");
			return 0;
		}

		while (1){
			if (B + 1 < N && S[B + 1] == '.' && B + 1 < D){
				B += 2;
			}
			else if (B < N && S[B] == '.'){
				B++;
			}
			else{
				printf("No\n");
				return 0;
			}
			if (B == D)
				break;
		}

	printf("Yes\n");
		return 0;


	}
}