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: Time Limit Exceeded)

import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;

public class Main {
	final int N, A, B, C, D;
	final char[] S;
	final Set<String> checked = new HashSet<String>();

	Main(int n, int a, int b, int c, int d, char[] s) {
		N = n;
		A = a;
		B = b;
		C = c;
		D = d;
		S = s;
	}

	public static void main(String[] args) {
		Main m;
		try (Scanner s = new Scanner(System.in)) {
			m = new Main(s.nextInt(),
					s.nextInt(),
					s.nextInt(),
					s.nextInt(),
					s.nextInt(),
					s.next().toCharArray());
		}

		if (m.move(m.A, m.B)) {
			System.out.println("Yes");
		} else {
			System.out.println("No");
		}
	}

	boolean move(int a, int b) {
		if (a == C && b == D) {
			return true;
		}

		if (checked.contains(a + "," + b)) {
			return false;
		}

		if (a > C) {
			return false;
		}

		if (b > D) {
			return false;
		}

		if (a == b) {
			return false;
		}

		if (S[b - 1] == '#') {
			return false;
		}

		if (S[a - 1] == '#') {
			return false;
		}

		boolean x = move(a + 2, b);
		if (!x) {
			checked.add((a + 2) + "," + b);
			x = move(a, b + 2);
		}
		if (!x) {
			checked.add(a + "," + (b + 2));
			x = move(a + 1, b);
		}
		if (!x) {
			checked.add((a + 1) + "," + b);
			x = move(a, b + 1);
		}
		if (!x) {
			checked.add(a + "," + (b + 1));
		}
		return x;
	}
}