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;

public class Main {

	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);

		int n = in.nextInt();
		int a = in.nextInt();
		int b = in.nextInt();
		int c = in.nextInt();
		int d = in.nextInt();

		String s = in.next();

		// 両端は要らない
		int r = c > d ? c : d;
		s = s.substring(a - 1, r);

		// 岩2連続以上→不可能
		if ( s.contains("##") ) {
			System.out.println("No");
		} else {

			// 追い越しの必要がない場合
			if ( c < d ) {
				System.out.println("Yes");
			} else
			// 追い越しの必要がある場合
			if ( d < c ) {
				// 追い越し場所ない場合
				if ( !s.contains("...") ) {
					System.out.println("No");
				} else {

					if ( s.charAt(b - 2) == '.' && s.charAt(b) == '.' ) {
						System.out.println("Yes");
						return;
					}

					if ( s.substring(b, d - 1).contains("...") ) {
						System.out.println("Yes");
						return;
					}

					if ( s.charAt(c - 2) == '.' && s.charAt(c) == '.') {
						System.out.println("Yes");
						return;
					}
					System.out.println("No");
					return;
				}
			}
		}
		in.close();
	}
}