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: Runtime Error)

package main

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

var sc = bufio.NewScanner(os.Stdin)

func nextInt() int {
	sc.Scan()
	i, e := strconv.Atoi(sc.Text())
	if e != nil {
		panic(e)
	}
	return i
}

func nextString() string {
	sc.Scan()
	return sc.Text()
}

func step(s string, i int, j int, max int) int {
	if i < max {
		if s[i] == 46 && i+1 != j {
			i++
		}
	}
	if i+1 < max {
		if s[i+1] == 46 && i+2 != j {
			i += 2
		}
	}
	return i
}

func check(index int, goal int) bool {
	return (index == goal)
}

func main() {
	sc.Split(bufio.ScanWords)
	n := nextInt()
	a := nextInt()
	b := nextInt()
	c := nextInt()
	d := nextInt()
	s := nextString()
	n++
	if c < d {
		for {
			if !check(b, d) && !(b >= d) {
				for !(b == step(s, b, a, d)) {
					b = step(s, b, a, d)
				}
			}

			if !check(a, c) && !(a >= c) {
				a = step(s, a, b, c)
			}

			if check(a, c) && check(b, d) {
				fmt.Println("Yes")
				break
			} else if ((a == step(s, a, b, c)) && (b == step(s, b, a, d))) || (check(b, d) && a == step(s, a, b, c)) || (check(a, c) && b == step(s, b, a, d)) {
				fmt.Println("No")
				break
			}
		}
	}

	if c > d {
		for {
			if !check(a, c) && !(a >= c) {
				for !(a == step(s, a, b, c)) {
					a = step(s, a, b, c)
				}
			}

			if !check(b, d) && !(b >= d) {
				b = step(s, b, a, d)
			}

			if check(a, c) && check(b, d) {
				fmt.Println("Yes")
				break
			} else if ((a == step(s, a, b, c)) && (b == step(s, b, a, d))) || (check(b, d) && a == step(s, a, b, c)) || (check(a, c) && b == step(s, b, a, d)) {
				fmt.Println("No")
				break
			}
		}
	}
}