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)

//21171_somesh || asomesh999

#include<bits/stdc++.h>
using namespace std;
#define fr(i,a,b) for(long long i=a;i<b;i++)
#define io ios::sync_with_stdio(false);cin.tie(NULL);
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<ll> vl;
long int mod=1000000007;

int main()
{
	io
	#ifdef SOMU
		clock_t startTime = clock();
		freopen("input.txt","r",stdin);
	#endif

	int n, a, b, c, d;
	cin >> n >> a >> b >> c >> d;
	string s;
	cin >> s;
	if(c < b) {
		int temp = 0;
		int maxSize = 0;
		fr(i, a - 1, c - 1) {
			if(s[i] == '#') {
				temp++;
			} else temp = 0;
			maxSize = max(maxSize, temp);
		}
		int flag = 0;
		if(maxSize > 1) {
			flag = 1;
		}
		maxSize = temp = 0;
		fr(i, b - 1, d - 1) {
			if(s[i] == '#') {
				temp++;
			} else temp = 0;
			maxSize = max(maxSize, temp);
		}
		if(maxSize > 1) {
			flag = 1;
		}
		if(flag) {
			cout << "No";
		} else {
			cout << "Yes";
		}
	} else {
		if(c > d) {
			int temp = 0;
			int maxSize = 0;
			fr(i, a - 1, c - 1) {
				if(s[i] == '#') {
					temp++;
				} else temp = 0;
				maxSize = max(maxSize, temp);
			}
			int flag = 0;
			if(maxSize > 1) {
				flag = 1;
			}
			maxSize = temp = 0;
			fr(i, b - 2, c - 1) {
				if(s[i] == '.') {
					temp++;
				} else temp = 0;
				maxSize = max(maxSize, temp);
			}
			if(maxSize < 3) {
				flag = 1;
			}
			if(flag) {
				cout << "No";
			} else {
				cout << "Yes";
			}
		} else {
			int maxSize = 0;
			int temp = 0;
			int flag = 0;
			fr(i, b - 1, d - 1) {
				if(s[i] == '#') {
					temp++;
				} else temp = 0;
				maxSize = max(maxSize, temp);
			}
			if(maxSize > 1) {
				flag = 1;
			}
			maxSize = temp = 0;
			fr(i, a - 1, c - 1) {
				if(s[i] == '#') {
					temp++;
				} else temp = 0;
				maxSize = max(maxSize, temp);
			}
			if(maxSize > 1) {
				flag = 1;
			}
			if(flag) {
				cout << "No";
			} else {
				cout << "Yes";
			}
		}
	}

	#ifdef SOMU
		cerr << endl <<setprecision(20)<< double( clock() - startTime ) / (double)CLOCKS_PER_SEC<< " seconds." << endl;
	#endif
	return 0;
}