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<cmath>
#include<climits>
#include<algorithm>
#include<sstream>
#include<iostream>
#include<string>
#include<queue>
#include<stack>
#include<set>
#include<list>
#include<map>
#include<vector>

using namespace std;


#define rep(i,n) for(int i=0; i<n; i++)
#define rept(i,a,b) for(int i=a; i<b; i++)
#define ll long long
#define MOD 1000000007

#define IMIN INT_MIN;
#define IMAX INT_MAX;


int main(){
	int N, A, B, C, D;
	cin >> N >> A >> B >> C >> D;
	A--;
	B--;
	C--;
	D--;
	string S;
	cin >> S;
	bool ok1 = true;
	bool ok2 = true;
	bool ok3 = false;
	bool spflag = false;
	//without position switch ABCD
	if (C < D) {
		rept(i, A, D-1) {
			if (S[i] == '#' && S[i+1] == '#') {
				ok1 = false;
				break;
			}
		}
		if (ok1) ok3 = true;
	}
	//with position switch ABDC
	else {
		ok1 = ok2 = true;
		//do BD first
		rept(i, B+1, D-1) {
			if ((S[i] == '#') && (S[i+1] == '#')) {
				ok1 = false;
				break;
			}
		}
		//check if there is a hole
		rept(i, B, D-1) {
			if (S[i] == '.' && S[i+1] == '.' && S[i+2] == '.') spflag = true;
		}
		if (ok1 && spflag) {
			//do AC
			rept(i, A+1, B) {
				if ((S[i] == '#') && (S[i+1] == '#')) {
					ok2 = false;
					break;
				}
			}
			rept(i, D, C-1) {
				if ((S[i] == '#') && (S[i+1] == '#')) {
					ok2 = false;
					break;
				}
			}
			if (ok2) ok3 = true;
		}
	}
	if (ok3) cout << "Yes" << endl;
	else cout << "No" << endl;


	return 0;
}