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: Wrong Answer)

import java.util.Scanner;

//6/1コンテスト

public class Main {
	public static void main(String[]args) {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int a = sc.nextInt();
		int b = sc.nextInt();
		int c = sc.nextInt();
		int d = sc.nextInt();
		int aa =0;
		int bb =0;
		int zz =0;
		String s = sc.next();
		String[] fruit = s.split("");
        int C = c-1;
		int D = d-1;

		for(int i=0;fruit.length>i;i++) {
			int A=a-1;
			int B=b-1;

			if(fruit[A].equals("#")) {
				System.out.println("NO");
				break;
			}
			if(fruit[B].equals("#")) {
				System.out.println("NO");
				break;
			}
			//if(A==B) {
				//System.out.println("NO");
				//break;
			//}

			if(A==C&&B==D) {
				System.out.println("YES");
				break;
			}

			if (A!=C&&B==D) {
				a++;
				if(fruit[a-1].equals("#")) {
					a++;
					aa =1;
					if(fruit[a-1].equals("#")) {
						System.out.println("NO");
						break;
				    }
				}

			}

			if (A==C&&B!=D) {
				b++;
				if(fruit[b-1].equals("#")) {
					b++;
					bb =1;
					if(fruit[b-1].equals("#")) {
						System.out.println("NO");
						break;
					}
				}

			}

			if (A!=C&&B!=D) {
				a++;
				b++;
				if(fruit[a-1].equals("#")) {
					a++;
					aa =1;
					if(fruit[a-1].equals("#")) {
						System.out.println("NO");
						break;
					}
				}
				if(fruit[b-1].equals("#")) {
					b++;
					bb =1;
					if(fruit[b-1].equals("#")) {
						System.out.println("NO");
						break;
					}
				}
			}

			if(A==B) {
				if(fruit[a-2].equals(".")) {
					a--;
				}
				else if(fruit[b-2].equals(".")) {
					b--;
				}
				else {
					System.out.println("NO");
					break;
				}

			}

		}

	}

}