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 <bits/stdc++.h>
using namespace std;

int main(int argc, char const *argv[])
{
	int n,a,b,c,d;
	string s;
	cin>>n>>a>>b>>c>>d>>s;
	--a,--b,--c,--d;
	int f=1;
	if (b>c)
	{
		for (int i = a+1; i <= b; ++i)
		{
			if (s.at(i-1)=='#'&&s.at(i)=='#')
			{
				f=0;
			}
		}
		for (int i = c+1; i <= d; ++i)
		{
			if (s.at(i-1)=='#'&&s.at(i)=='#')
			{
				f=0;
			}
		}
		if (f==1)
		{
			cout<<"Yes\n";
		}
		else
		{
			cout<<"No\n";
		}
		return 0;
	}
	for (int i = min(a,b)+1; i <= max(c,d); ++i)
	{
		if (s.at(i-1)=='#'&&s.at(i)=='#')
		{
			f=0;
		}
	}
	if (f==0)
	{
		cout<<"No\n";
		return 0;
	}
	if (c<d)
	{
		cout<<"Yes\n";
		return 0;
	}
	f=0;
	int mi=a,ma=c;
	while (mi>0&&(s.at(mi-1)!='#'||s.at(mi)!='#'))
	{
		--mi;
	}
	while (ma<n-1&&(s.at(ma)!='#'||s.at(ma+1)!='#'))
	{
		++ma;
	}
	for (int i = mi+2; i <= ma; ++i)
	{
		if (s.at(i-2)=='.'&&s.at(i-1)=='.'&&s.at(i)=='.')
		{
			f=1;
		}
	}
	if (f==1)
	{
		cout<<"Yes\n";
		return 0;
	}
	cout<<"No\n";
	return 0;
}