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 JavaScript (node.js v5.12) (judge verdict: Wrong Answer)

var main = standardInput => {
  var ary = standardInput.split(" ");
  ary = ary.map(v => {
    return parseInt(v, 10);
  });

  var inputLines = standardInput.split("\n").map(function(v) {
    return v;
  });
  var line0 = inputLines[0].split(" ");
  var road = inputLines[1];
  road = "X" + road;

  var N = parseInt(line0[0], 10);
  var A = parseInt(line0[1], 10);
  var B = parseInt(line0[2], 10);
  var C = parseInt(line0[3], 10);
  var D = parseInt(line0[4], 10);

  function checkPlace(i) {
    var target = i;
    if (target > N) return false;
    var bool = road[target] === "." && target !== A && target !== B;
    return bool;
  }

  function check1(AorB) {
    var target = AorB + 1;
    if (target > N) return false;
    var bool = road[target] === "." && target !== A && target !== B;
    return bool;
  }

  function check2(AorB) {
    var target = AorB + 2;
    if (target >= N) return false;
    var bool = road[target] === "." && target !== A && target !== B;
    return bool;
  }

  if (C < D) {
    while (B !== D) {
      if (check2(B)) {
        B += 2;
      } else if (check1(B)) {
        B += 1;
      } else {
        console.log("No");
        process.exit(0);
      }
    }

    while (A !== C) {
      if (check2(A)) {
        A += 2;
      } else if (check1(A)) {
        A += 1;
      } else {
        console.log("No");
        process.exit(0);
      }
    }

    console.log("Yes");

  } else if (D < C) {
    while (B !== D) {
      if (checkPlace(B - 1) && checkPlace(B + 1)) {
        break;
      } else if (check1(B)) {
        B += 1;
      } else if (check2(B)) {
        B += 2;
      } else {
        console.log("No");
        process.exit(0);
      }
    }

    while (A !== C) {
      if (check2(A)) {
        A += 2;
      } else if (check1(A)) {
        A += 1;
      } else {
        console.log("No");
        process.exit(0);
      }
    }

    while (B !== D) {
      if (check2(B)) {
        B += 2;
      } else if (check1(B)) {
        B += 1;
      } else {
        console.log("No");
        process.exit(0);
      }
    }
    console.log("Yes");
  }
};

main(require("fs").readFileSync("/dev/stdin", "UTF-8"));