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)

#include <stdio.h>
#include <math.h>
#include <string.h>
#include <stdlib.h>
#pragma warning( disable:4996 )
#define SWAP(a,b) (a += b,b = a - b,a -= b)
#define MIN(a, b) ((a) < (b) ? (a) : (b))


int main(void) {
	int n, a, b, c, d;
	char s[200002];
	scanf("%d %d %d %d %d", &n, &a, &b, &c, &d);
	scanf("%s", s);

	if (c < d) {
		while (1) {
			if (d - b <= 2) {
				b = d;
				break;
			}
			if (s[b + 1] == '.') {
				b++;
				continue;
			}
			if (s[b + 2] == '.') {
				b += 2;
				continue;
			}
			printf("No\n");
			return 0;
		}
		while (1) {
			if (c - a <= 2) {
				a = c;
				break;
			}
			if (s[a + 1] == '.') {
				a++;
				continue;
			}
			if (s[a + 2] == '.') {
				a += 2;
				continue;
			}
			printf("No\n");
			return 0;
		}
		printf("Yes\n");
	}else{
		int spaceok = 0;
		int index;
		for (int i = b; i <= d; i++) {
			if (s[i - 2] == '.' && s[i - 1] == '.'&&s[i] == '.') {
				spaceok = 1;
				index = i;
				break;
			}
		}
		if (spaceok) {
			//move b
			while (1) {
				if (index - b <= 2) {
					b = index;
					break;
				}
				if (s[b + 1] == '.') {
					b++;
					continue;
				}
				if (s[b + 2] == '.') {
					b += 2;
					continue;
				}
				printf("No\n");
				return 0;
			}
			while (1) {
				if (c - a <= 2) {
					a = c;
					break;
				}
				if (s[a + 1] == '.') {
					a++;
					continue;
				}
				if (s[a + 2] == '.') {
					a += 2;
					continue;
				}
				printf("No\n");
				return 0;
			}
			while (1) {
				if (d - b <= 2) {
					printf("Yes\n");
					return 0;
					break;
				}
				if (s[b + 1] == '.') {
					b++;
					continue;
				}
				if (s[b + 2] == '.') {
					b += 2;
					continue;
				}
				printf("No\n");
				return 0;
			}
		}
		else {
			printf("No\n");
			return 0;
		}
	}

	return 0;
}