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 Java8 (OpenJDK 1.8.0) (judge verdict: Runtime Error)

//ごみこーどちゅうい！

import java.util.Scanner;
public class Main {
	public static void main(String[] args) {
		Scanner scan=new Scanner(System.in);
		int a=scan.nextInt();
		int b=scan.nextInt();
		int c=scan.nextInt();
		int d=scan.nextInt();
		int f=scan.nextInt();
		String str=scan.next();
		int sunu=b-1;//配列対応
		int hunu=c-1;//配列対応
		if(d>f) {//とりあえず抜けすぬけ君！(完了)
			for(;;) {//ここで、ふぬけくんの±1をからにしよう！(完了)

				if(hunu==a-1) {
					System.out.println("No");
					System.exit(0);;
				}
				char ch3=' ';
				char ch1=str.charAt(hunu-1);
				char ch2=str.charAt(hunu+1);
				if(hunu<a-2) {
				ch3=str.charAt(hunu+2);}
				if(ch1=='.'&&ch2=='.') {
					break;
				}
				if(ch2=='.') {
					hunu++;
				}
				else {
					if(hunu<a-2) {
					if(ch3=='.') {
						hunu+=2;
					}
					else {
						System.out.println("No");
						System.exit(0);;
					}
					}
				}
			}
			sunu=hunu+1;
			if(sunu==d-1) {//壁突破しないように
				if(hunu==f-1) {
					System.out.println("Yes");
					System.exit(0);;
				}
			}
			for(;;) {//こっから一直線に走れ！！！まずはすぬけ君！
				char ch2=str.charAt(sunu+1);
				char ch3=' ';
				if(sunu<a-2) {
				ch3=str.charAt(sunu+2);
				}
				if(ch2=='.') {
					sunu++;
				}
				else {
					if(sunu<a-2) {
					if(ch3=='.') {
						sunu+=2;
					}
					else {
						System.out.println("No");
						System.exit(0);;
					}
					}
				}
				if(sunu==d-1) {//おめでとう！ゴールだ！
					break;
				}			
				}
			for(;;) {//つぎはふぬけ君！
				char ch2=str.charAt(hunu+1);
				char ch3=' ';
				if(hunu<a-2) {
				ch3=str.charAt(hunu+2);
				}
				if(ch2=='.') {
					hunu++;
				}
				else {
					if(hunu<a-2) {
					if(ch3=='.') {
						hunu+=2;
					}
					else {
						System.out.println("No");
						System.exit(0);;
					}
					}
				}
				if(hunu==f-1) {//おめでとう！ゴールだ！
					System.out.println("Yes");
					System.exit(0);;
				}			
				}
				
		}
		else {
			if(sunu==a-1) {
				System.out.println("No");
				System.exit(0);;
			}
			for(;;) {//こっから一直線に走れ！！！まずはふぬけ君！
				char ch2=str.charAt(hunu+1);
				char ch3=' ';
				if(hunu<a-2) {
				ch3=str.charAt(hunu+2);
				}
				if(ch2=='.') {
					hunu++;
				}
				else {
					if(hunu<a-2) {
					if(ch3=='.') {
						hunu+=2;
					}
					else {
						System.out.println("No");
						System.exit(0);;
					}
					}
				}
				if(hunu==f-1) {//おめでとう！ゴールだ！
					break;
				}	
			}
			for(;;) {//つぎはすぬけ君！
				char ch2=str.charAt(sunu+1);
				char ch3=' ';
				if(sunu<a-2) {
				ch3=str.charAt(sunu+2);
				}
				if(ch2=='.') {
					sunu++;
				}
				else {
					if(sunu<a-2) {
					if(ch3=='.') {
					sunu+=2;
					}
					else {
						System.out.println("No");
						System.exit(0);;
					}
					}
				}
				if(sunu==d-1) {//おめでとう！ゴールだ！
					System.out.println("Yes");
					System.exit(0);;
				}			
			}
		}
	}
}