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 n,a,b,c,d,i=300000;
	string s;
	cin>>n>>a>>b>>c>>d>>s;
	if (a>b&&c>d)
	{
		swap (a,b);
		swap (c,d);
	}
	if ((a>b&&c<d)||(a<b&&c>d))
	{
		for (i=0;i<n-2;i++) if (s.substr(i,3)=="...") break;
		if (i==n-3&&s.substr(i,3)!="...")
		{
		    cout<<"NO";
			return 0;
		}
	}
	if (i==300000)
	{
		for (int j=b-1;j<d-1;)
		{
			if ((d-j-1)%2==0)
			{
				if (s[j+2]=='.') j+=2;
				else if (s[j+1]=='.') j++;
				else
				{
					cout<<"NO";
					return 0;
				}
			}
			else
			{
				if (s[j+1]=='.') j++;
				else if (s[j+2]=='.') j+=2;
				else
				{
					cout<<"NO";
					return 0;
				}
			}
		}
		for (int k=a-1;k<c-1;)
		{
			if ((c-k-1)%2==0)
			{
				if (s[k+2]=='.') k+=2;
				else if (s[k+1]=='.') k++;
				else
				{
					cout<<"NO";
					return 0;
				}
			}
			else
			{
				if (s[k+1]=='.') k++;
				else if (s[k+2]=='.') k+=2;
				else
				{
					cout<<"NO";
					return 0;
				}
			}
		}
	}
	else
	{
		for (int l=max(a,b)-1;l<i+1;)
		{
			if ((i+1-l)%2==0)
			{
				if (s[l+2]=='.') l+=2;
				else if (s[l+1]=='.') l++;
				else
				{
					cout<<"NO";
					return 0;
				}
			}
			else
			{
				if (s[l+1]=='.') l++;
				else if (s[l+2]=='.') l+=2;
				else
				{
					cout<<"NO";
					return 0;
				}
			}
		}
		for (int m=min(a,b)-1;m<i+2;)
		{
			if ((i-m+2)%2==0)
			{
				if (s[m+2]=='.'&&m+2!=i+1) m+=2;
				else if (s[m+1]=='.'&&m+1!=i+1) m++;
				else
				{
					cout<<"NO";
					return 0;
				}
			}
			else
			{
				if (s[m+1]=='.'&&m+1!=i+1) m++;
				else if (s[m+2]=='.'&&m+2!=i+1) m+=2;
				else
				{
					cout<<"NO";
					return 0;
				}
			}
		}
	}
	cout<<"YES";
	return 0;
}