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 JavaScript (node.js v5.12) (judge verdict: Wrong Answer)

function Main(input) {
	lines = input.split("\n");
	N = parseInt(lines[0].split(' ')[0], 10);
	A = parseInt(lines[0].split(' ')[1], 10);
	B = parseInt(lines[0].split(' ')[2], 10);
	C = parseInt(lines[0].split(' ')[3], 10);
	D = parseInt(lines[0].split(' ')[4], 10);
	S = lines[1].split('');
	flag = false;
	while(A !== C || B !== D) {
	  if(S[A+1] !== '#' && A+2 !== B && A+2 <= C && A+2 <= N) { A+=2; }
	  else if(S[A] !== '#' && A+1 !== B && A+1 <= C && A+1 <= N) { A++; }
	  else if(S[B+1] !== '#' && B+2 !== A && B+2 <= D && B+2 <= N){ B+=2; }
	  else if(S[B] !== '#' && B+1 !== A && B+1 <= D && B+1 <= N){ B++; }
	  else { flag=true; break; }
	}
	flag ? console.log('No') : console.log('YES');
}
Main(require("fs").readFileSync("/dev/stdin", "utf8"));