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 Go (1.6) (judge verdict: Wrong Answer)

package main

import (
  "fmt"
  "bufio"
  "os"
  "strconv"
)

func main () {
  sc := bufio.NewScanner(os.Stdin)
  sc.Split(bufio.ScanWords)
  buf := make([]byte, 0)
  sc.Buffer(buf, 200001)

  sc.Scan()
  n, _ := strconv.Atoi(sc.Text())

  sc.Scan()
  a, _ := strconv.Atoi(sc.Text())
  a--

  sc.Scan()
  b, _ := strconv.Atoi(sc.Text())
  b--

  sc.Scan()
  c, _ := strconv.Atoi(sc.Text())
  c--

  sc.Scan()
  d, _ := strconv.Atoi(sc.Text())
  d--

  sc.Scan()
  s := sc.Text()


  rock := make([]int, 0, n)

  if c < d {
    for i := a; i < d; i++ {
      if s[i] == '#' {
        rock = append(rock, i)
      }
    }
    if len(rock) == 0 {
      fmt.Println("Yes")
      os.Exit(0)
    }

    for i := 0; i < len(rock) - 1; i++ {
      if rock[i + 1] - rock[i] == 1 {
        fmt.Println("No")
        os.Exit(0)
      }
    }
    fmt.Println("Yes")
    os.Exit(0)
  } else {
    for i := 0; i < c; i++ {
      if s[i] == '#' {
        rock = append(rock, i)
      }
    }
    if c < b {
      fmt.Println("No")
    }
    if len(rock) == 0 {
      fmt.Println("Yes")
      os.Exit(0)
    }

    var r bool
    for i := 0; i < len(rock) - 1; i++ {
      if rock[i + 1] - rock[i] == 1 {
        fmt.Println("No")
        os.Exit(0)
      }
      if rock[i + 1] - rock[i] > 3 && rock[i] > b  && rock[i + 1] < d {
        r = true
      }
    }
    if !r {
      if d - rock[len(rock) - 1] == 1 {
        fmt.Println("No")
        os.Exit(0)
      }
      if n - 1 - rock[len(rock) - 1] > 3 {
        r = true
      }
    }
    if r {
      fmt.Println("Yes")
      os.Exit(0)
    } else {
      fmt.Println("No")
      os.Exit(0)
    }
  }
}