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

#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int N = 2e5+100;
int len;
char str[N];

bool check(int l, int r, char tag[])
{
	char ct = str[r+1];
	str[r+1] = '\0';
	char *p = strstr(str+l, tag);
	str[r+1] = ct;
	return p != 0;
}

int getl(int l)
{
		while (l >= 0) {
			if (l >= 2 && str[l-2] == '.') l-=2;
			else if (l >= 1 && str[l-1] == '.') l-=1;
			else break;
		}
		return l;
}
int getr(int r)
{
		while (r < len) {
			if (r+2<len && str[r+2] == '.') r+=2;
			else if (r+1<len && str[r+1] == '.') r+=1;
			else break;
		}
		return r;
}

int main()
{
	int n, a, b, c, d;
	while (scanf("%d%d%d%d%d", &n, &a, &b, &c, &d) != EOF) {
		scanf("%s", str);
		--a; --b; --c; --d;
		len = strlen(str);
		int al=getl(a), ar = getr(a);
		int bl=getl(b), br = getr(b);
		if (str[a] != '.' || str[b] != '.' || str[c] != '.' || str[d] != '.') {
			puts("No");
			continue;
		}
		if (br < d || ar < c || d == c) {
			puts("No");
		} else if (d > c) {
			puts("Yes");
		} else if (c > d) {
			if (check(al, br, "...")) puts("Yes");
			else puts("No");
		}
		else puts("No");
	}
	return 0;
}