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: Accepted)

import java.util.*;

public class Main {

    public static void main(String args[]) {

        // 入力
        Scanner sc = new Scanner(System.in);
        int n = Integer.parseInt(sc.next());
        int a = Integer.parseInt(sc.next()) - 1;
        int b = Integer.parseInt(sc.next()) - 1;
        int c = Integer.parseInt(sc.next()) - 1;
        int d = Integer.parseInt(sc.next()) - 1;
        String s = sc.next();
        sc.close();

        // 主処理
        boolean judge = canThroughtWall(s, a, c) && canThroughtWall(s, b, d); // 2連続で壁がないことをチェック
        // cの移動経路がaと完全に重なる場合
        if (b < c && d < c) {
            judge = judge && canMoveNotWallSide(s, b, d);
        }
        String result = judge ? "Yes" : "No";

        // 出力
        System.out.println(result);
    }

    public static boolean canThroughtWall(String s, int startIndex, int endIndex) {
        for (int i = startIndex; i < endIndex; i++) {
            char left = s.charAt(i);
            char right = s.charAt(i + 1);
            if (left == '#' && right == '#') {
                return false;
            }
        }
        return true;
    }

    public static boolean canMoveNotWallSide(String s, int startIndex, int endIndex) {
        for (int i = startIndex; i <= endIndex; i++) {
            char left = s.charAt(i - 1);
            char right = s.charAt(i + 1);
            if (s.charAt(i) == '.' && left == '.' && right == '.') {
                return true;
            }
        }
        return false;
    }
}