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 (
	BufferSize = 10*10*10*10*10 + 10
	n          = 0
	a          = 0
	b          = 0
	c          = 0
	d          = 0
	s          = ""
)

func scanStr(sc *bufio.Scanner) string {
	if !sc.Scan() {
		panic(nil)
	}

	return sc.Text()
}

func scanInt(sc *bufio.Scanner) int {
	if !sc.Scan() {
		panic(nil)
	}

	i, err := strconv.Atoi(sc.Text())
	if err != nil {
		panic(err)
	}

	return i
}

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

	n = scanInt(sc)
	a = scanInt(sc) - 1
	b = scanInt(sc) - 1
	c = scanInt(sc) - 1
	d = scanInt(sc) - 1
	s = scanStr(sc)

	if c > d {
		abdc()
		return
	}

	if c > b {
		acbd()
		return
	}

	abcd()

}

func all() {
	lockIndex := make([]int, 0, 0)
	for i := 0; i < n; i++ {
		if s[i] == '#' {
			lockIndex = append(lockIndex, i)
		}
	}

	fmt.Printf("Yes\n")
}

func abdc() {
	canMove := false
	for i := b; ; {
		if i == d || i+1 == d || i+2 == d {
			break
		}

		if s[i+1] == '.' {
			if s[i+1-1] != '#' && s[i+1+1] != '#' {
				canMove = true
			}
			i += 1
			continue
		}

		if s[i+2] == '.' {
			i += 2
			continue
		}

		fmt.Printf("No\n")
		return
	}

	if !canMove {
		fmt.Printf("No\n")
		return
	}

	for i := d; ; {
		if i == c || i+1 == c || i+2 == c {
			break
		}

		if s[i+2] == '.' {
			i += 2
			continue
		}

		if s[i+1] == '.' {
			i += 1
			continue
		}

		fmt.Printf("No\n")
		return
	}

	fmt.Printf("Yes\n")
}

func acbd() {
	for i := b; ; {
		if i == d || i+1 == d || i+2 == d {
			break
		}

		if s[i+2] == '.' {
			i += 2
			continue
		}

		if s[i+1] == '.' {
			i += 1
			continue
		}

		fmt.Printf("No\n")
		return
	}

	for i := a; ; {
		if i == c || i+1 == c || i+2 == c {
			break
		}

		if s[i+2] == '.' && i+2 != d {
			i += 2
			continue
		}

		if s[i+1] == '.' && i+1 != d {
			i += 1
			continue
		}

		fmt.Printf("No\n")
		return
	}

	fmt.Printf("Yes\n")

}

func abcd() {
	for i := b; ; {
		if i == d || i+1 == d || i+2 == d {
			break
		}

		if s[i+2] == '.' {
			i += 2
			continue
		}

		if s[i+1] == '.' {
			i += 1
			continue
		}

		fmt.Printf("No\n")
		return
	}

	for i := a; ; {
		if i == c || i+1 == c || i+2 == c {
			break
		}

		if s[i+2] == '.' {
			i += 2
			continue
		}

		if s[i+1] == '.' {
			i += 1
			continue
		}

		fmt.Printf("No\n")
		return
	}

	fmt.Printf("Yes\n")

}

func main() {
	check()
}