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: Accepted)


#define ll				long long
#define MOD				1000000007
#define VTX_MAX			10000
#define EDGE_MAX		10000

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


FILE *in, *ans;
int tno;

int out(const char *s) {
#ifdef TEST
	char buf[8192];
	fgets(buf, sizeof(buf), ans);
	if (strcmp(buf, s)) {
		printf("err\n");
	}
#else
	printf(s);
#endif
	return 0;
}

int outi(int i) {
	char s[128];
	sprintf(s, "%d\n", i);
	out(s);
	return 0;
}

int outd(double d) {
	char s[128];
	sprintf(s, "%.10lf\n", d);
	out(s);
	return 0;
}

int outll(ll l) {
	char s[128];
	sprintf(s, "%lld\n", l);
	out(s);
	return 0;
}

int geti() {
	int i;
	fscanf(in, "%d", &i);
	return i;
}

ll getll() {
	ll l;
	fscanf(in, "%lld", &l);
	return l;
}

int getstr(char *s) {
	fscanf(in, "%s", s);
	return 0;
}

int n, a, b, c, d;
char s[200010];

int move(int f, int t) {
	int i;


	for (i = f; i < t; i++) {
		if (s[i + 1] == '#') {
			if (s[i + 2] == '#') {
				return -1;
			}
			i++;
		}
	}

	return 0;
}

int moveb() {
	while (b < d) {
		b++;
		if (s[b] == '.') {
			return 0;
		}
	}

	return -1;
}

int move2() {
	int ret;

	for ( ; a < c; a++) {
		if (s[a + 1] == '#' || a + 1 == b) {
			if (s[a + 2] == '#' || a + 2 == b) {
				if (a + 1 == b) {
					ret = moveb();
					if (ret != 0) {
						return -1;
					}
				}
				else if (a + 2 == b) {
					ret = moveb();
					if (ret != 0) {
						return -1;
					}
					a++;
				}
				else {
					return -1;
				}
			}
			else {
				a++;
			}
		}
	}

	return 0;
}

int fnc2() {
	int i, j, k, ret;

	n = geti();
	a = geti() - 1;
	b = geti() - 1;
	c = geti() - 1;
	d = geti() - 1;
	getstr(s);

	ret = move(b, d);
	if (ret != 0) {
		return -1;
	}

	if (c < d) {
		ret = move(a, c);
	}
	else {
		ret = move2();
	}
	if (ret != 0) {
		return -1;
	}

	return 0;
}

int fnc1() {
	int ret = fnc2();
	if (ret == 0) {
		out("Yes\n");
	}
	else {
		out("No\n");
	}
	return 0;
}

int main() {

#ifdef TEST
	for (tno = TEST_SNO; tno <= TEST_ENO; tno++) {
		char str[128];
		sprintf(str, "test%d.txt", tno);
		in = fopen(str, "r");
		sprintf(str, "ans%d.txt", tno);
		ans = fopen(str, "r");
		fnc1();
		fclose(in);
		fclose(ans);
	}
	printf("end\n");
#else
	in = stdin;
	fnc1();
#endif

	return 0;
}