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){
  let Line = input.split('\n');
  let Line1 = Line[0].split(' ').map(n => parseInt(n));

  // Translate to index value
  var A = Line1[1] - 1;
  var B = Line1[2] - 1;
  let C = Line1[3] - 1;
  let D = Line1[4] - 1;

  let S = Line[1].trim();

  // console.log("Pattern:ABDC"); 
  if (B < D && D < C) {

    var comma = [];
    comma3check(S, comma);
    let overtake_index = isSpace3Existing(B, C, comma);

    // BがCに到着するまでにAがBを追い越せないならNG
    if (overtake_index == -1) {
      console.log("No");
      return;

    } else {
      A = overtake_index + 2;
      B = overtake_index;
    }
    
  }
  
  var rock = [];
  rock2check(S, rock);
  let A_flag = !isRockExisting(A, C, rock);
  let B_flag = !isRockExisting(B, D, rock);

  if (A_flag && B_flag){
    console.log("Yes");
  } else {
    console.log("No");
  }

}

// 空白が連続して３つ以上あれば追い抜ける
// 空白が連続する開始位置のインデックスを返却
// 追い抜けないときは-1を返却
function isSpace3Existing(start, end, space) {
  var overtake_index = -1;
  const result = space.some(elm => {
    overtake_index = elm;
    return(start < elm && elm <= end - 1);
  });
  return overtake_index;
}

// 岩が連続してあればtrue(通れない）
function isRockExisting(start, end, rock) {
  const result = rock.some(elm => {
    return(start - 1 <= elm && elm < end - 2);
  });
  return result;
}

// 自身と次が岩であれば自身のインデックスを格納する
function rock2check(S, rock){
  for (let i = 0; i < S.length - 1; i++) {
    if (S[i] == '#' && S[i + 1] == '#') {
      rock.push(i);
    }
  }
}

// 自身から３つ空白が続いたら自身のインデックスを格納する
function comma3check(S, comma) {
  for (let i = 0; i < S.length - 2; i++) {
    if (S[i] == '.' && S[i + 1] == '.' && S[i + 2] == '.') {
      comma.push(i);
    }
  }
}

Main(require("fs").readFileSync("/dev/stdin","utf-8"));