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)

'use strict'

function Main(input) {
  const N = Number(input.split("\n")[0].split(" ")[0])
  const A = Number(input.split("\n")[0].split(" ")[1])
  const B = Number(input.split("\n")[0].split(" ")[2])
  const C = Number(input.split("\n")[0].split(" ")[3])
  const D = Number(input.split("\n")[0].split(" ")[4])
  const S = input.split("\n")[1].split("")

  // ふぬけ移動
  for(let i=B; i<D; i++) {
    if(S[i-1] === "#" && S[i] === "#") {
      console.log("No")
      return
    }
  }

  S[D-1] = "#"
  
  // すぬけ移動
  for(let j=A; j<C; j++) {
    if(S[j-1] === "#" && S[j] === "#") {
      break
    }
    if(j === C-1) {
      console.log("Yes")
      return
    }
  }

  // ふぬけが途中で止まる場合
  S[D-1] = "."
  let pass = false

  for(let k=B; k<D-1; k++) {
    if(D - B < 3) {
      pass = true
      break
    }
    if(S[k-1] === "." && S[k] === "." && S[k+1] === ".") {
      S[k] = "#"
      break
    }
    if(k === D-2) {
      pass = true
      break
    }
  }

  if(!pass) {
    for(let l=A; l<C; l++) {
      if(S[l-1] === "#" && S[l] === "#") {
        break
      }
      if(l === C-1) {
        console.log("Yes")
        return
      }
    }
  }
  
  // ふぬけ引き返しパターン
  if(N === C) {
    console.log("No")
    return
  }

  let hunuke = 0
  for(let m=C; m<=N; m++) {
    if(S[m-1] === ".") {
      S[m-1] = "#"
      hunuke = m
      break
    }
    if(m === N) {
      console.log("No")
      return
    }
  }

  for(let n=A; n<C; n++) {
    if(S[n-1] === "#" && S[n] === "#") {
      console.log("No")
      return
    }
    if(n === C-1) {
      S[n-1] = "#"
      break
    }
  }
  
  for(let o=hunuke; o>D; o--) {
    if(S[o+1] === "#" && S[o] === "#") {
      console.log("No")
      return
    }
    if(o === D+1) {
      console.log("Yes")
      return
    }
  }

  console.log("No")

}

Main(require("fs").readFileSync("/dev/stdin", "utf8").trim())