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: Runtime Error)

/*
	submission # - User: herp_sy
	https://atcoder.jp/contests/
*/

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
#include <time.h>

#define _CRT_SECURE_NO_WARNINGS

int DESC(const int *a,const int *b){
	return (*b - *a);
}

void append(int *array,int *size,int num){
	realloc(array, sizeof(int) * (*size + 1));
	array[(*size)] = num;
	++(*size);
}

int main(int argc, char const *argv[])
{
	int n,a,b,c,d;
	int bsize = 0,*block,bcnt = 0;
	char s[200003];
	scanf("%d%d%d%d%d",&n,&a,&b,&c,&d);
	scanf("%s",s);
	block = (int *)malloc(sizeof(int) * bsize);

	for (int i = 0; i + 1 < n; ++i)
	{
		if(s[i] == '#'){
			append(block,&bsize,bcnt);
			bcnt = 0;
			if(s[i + 1] == '#'){
				puts("No");
				return 0;
			}
		}
		else	++bcnt;
	}
	if(c < d){
		puts("Yes");
		return 0;
	}
	else if(c > d){
		qsort(block,bsize,sizeof(int),DESC);
		if(block[0] >= 3)	puts("Yes");
		else puts("No");
		return 0;
	}
}