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: Accepted)

package main

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

var sc = bufio.NewScanner(os.Stdin)

const inf = 1 << 60
const mod int = 1e9 + 7

func init() {
	sc.Buffer(make([]byte, 1e7), 1e7)
}

func ri() (n int) {
	sc.Scan()
	for _, v := range sc.Bytes() {
		n = n*10 + int(v-48)
	}
	return
}

func rb() []byte {
	sc.Scan()
	return sc.Bytes()
}

func main() {
	sc.Split(bufio.ScanWords)
	_, a, b, c, d := ri(), ri()-1, ri()-1, ri()-1, ri()-1
	s := rb()

	canReach := func(start, end int) bool {
		for i := start; i+1 <= end; i++ {
			if s[i] == '#' && s[i+1] == '#' {
				return false
			}
		}
		return true
	}

	canOvertake := func(start, end int) bool {
		for i := start; i+2 <= end; i++ {
			if s[i] == '.' && s[i+1] == '.' && s[i+2] == '.' {
				return true
			}
		}
		return false
	}

	var ans bool
	if c < b {
		if canReach(a, c) && canReach(b, d) {
			ans = true
		} else {
			ans = false
		}
	} else if c < d {
		if canReach(b, d) {
			s[b] = '.'
			s[d] = '#'
			if canReach(a, c) {
				ans = true
			} else {
				ans = false
			}
		} else {
			ans = false
		}
	} else {
		if canReach(b, d) {
			if canReach(a, b) && canReach(d, c) {
				s[b] = '.'
				s[d] = '.'
				if canOvertake(b-1, d+1) {
					ans = true
				} else {
					ans = false
				}
			} else {
				ans = false
			}
		} else {
			ans = false
		}
	}

	if ans {
		fmt.Println("Yes")
	} else {
		fmt.Println("No")
	}
}