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 OCaml (4.02.3) (judge verdict: Wrong Answer)

Scanf.scanf " %d %d %d %d %d" @@ fun n a b c d ->
  let a, b, c, d = a - 1, b - 1, c - 1, d - 1 in
  let s = Scanf.scanf " %s" @@ fun s -> s in
  let l, l_end, r, r_end = if a < b then a, c, b, d else b, d, a, c in
  let dp = Array.make n false in
  dp.(r) <- true;
  dp.(r + 1) <- s.[r + 1] <> '#';
  for i = r + 2 to n - 1 do
    dp.(i) <- s.[i] <> '#' && (dp.(i - 1) || dp.(i - 2))
  done;
  if not dp.(r_end) then (print_endline "No"; exit 0);
  let dp = Array.make n false in
  dp.(l) <- true;
  dp.(l + 1) <- s.[l + 1] <> '#';
  for i = l + 2 to n - 1 do
    dp.(i) <- s.[i] <> '#' && (dp.(i - 1) || dp.(i - 2))
  done;
  if not dp.(l_end) then (print_endline "No"; exit 0);
  let b = Bytes.of_string s in
  for i = 0 to n - 1 do
    if Bytes.get b i = '.' then Bytes.set b i '_';
  done;
  let s = Bytes.to_string b in
  print_endline @@
    if s.[r_end - 1] = '#' || (r_end + 1 < n && s.[r_end + 1] = '#') then
      try
        let i = Str.search_forward (Str.regexp "___") s r in
        if i < r_end then "Yes" else "No" with
      | _ -> "No"
    else "Yes"