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 (
	"bufio"
	"fmt"
	"os"
	"strconv"
)

func out(x ...interface{}) {
	fmt.Println(x...)
}

var sc = bufio.NewScanner(os.Stdin)

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

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

// min, max, asub, absなど基本関数
func max(a, b int) int {
	if a > b {
		return a
	}
	return b
}

func min(a, b int) int {
	if a < b {
		return a
	}
	return b
}

func asub(a, b int) int {
	if a > b {
		return a - b
	}
	return b - a
}

func abs(a int) int {
	if a >= 0 {
		return a
	}
	return -a
}

func check1(f, t, n int, s string) bool {
	// out(f, t)
	for i := f + 1; i <= t; i++ {
		if s[i] == '#' && s[i-1] == '#' {
			return false
		}
	}
	return true
}

func check2(b, d int, s string) bool {
	cnt := 0
	m := 0
	for i := b; i <= d; i++ {
		// out(cnt, s, i, s[i])
		if s[i] == '.' {
			cnt++
		} else {
			m = max(m, cnt)
			cnt = 0
		}
	}
	if m >= 3 {
		return true
	}
	return false
}

func main() {
	sc.Split(bufio.ScanWords)
	sc.Buffer([]byte{}, 1000000)

	N, A, B, C, D := getInt(), getInt()-1, getInt()-1,
		getInt()-1, getInt()-1
	s := getString()

	ans := true
	if s[C] == '#' || s[D] == '#' {
		ans = false
	}
	ret := check1(A, C, N, s)
	ans = ans && ret
	// out(ret)
	ret = check1(B, D, N, s)
	ans = ans && ret
	// out(ret)
	if C > B && C > D {
		ret = check2(B, D, s)
		ans = ans && ret
		// out(ret)
		// out(ans)
	}
	if ans {
		out("Yes")
	} else {
		out("No")
	}
}