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) {

//		標準入力6つ
		Scanner s = new Scanner(System.in);
		Scanner s1 = new Scanner(System.in);
		System.out.println("N:");
		int n = s.nextInt();

		String[] route = new String[n+1];
		System.out.println("a:");
		int a = s.nextInt()-1;
		System.out.println("b:");
		int b = s.nextInt()-1;
		System.out.println("c:");
		int c = s.nextInt()-1;
		System.out.println("d:");
		int d = s.nextInt()-1;
		System.out.println("route:");
		String gan = s1.nextLine();

//		routeにするために１文字ずつ区切らないと
		route = gan.split("");

		boolean bool = false;
		if(route[a].equals("#")||route[b].equals("#")||route[c].equals("#") ||route[d].equals("#")
				|| a >= b|| a >= c|| b >= d|| d > n) {
			System.out.println("設定がおかしいです");
		}else {

//		いけるかどうかの判定
			if(c < d) {
				while(b < d) {
					if(route[b+1].equals("#") && route[b+2].equals("#")) {
						break;
					}else if(route[b+1].equals(".")) {
						b +=1;
					}else {
						b +=2;
					}
				}
				while(a < c) {
					if(route[a+1].equals("#")&& route[a+2].equals("#")) {
						break;
					}else if(route[a+1].equals(".")) {
						a +=1;

					}else {
						a +=2;
					}
				}
				if(b == d && a ==c) {
					bool = true;
				}
			}else {
				for(int i = b+1 ; i < d; i++) {
					if(route[i-1].equals(".")&&route[i].equals(".")&&route[i+1].equals(".")) {
						bool = true;

						break;
					}
				}
			}
			if(bool == true) {
				System.out.println("Yes");
			}else {
				System.out.println("No");
			}
		}
	}

}