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 Kotlin (1.0.0) (judge verdict: Accepted)

import java.util.*

fun main(args: Array<String>) {
    val scanner = Scanner(System.`in`)
    /*val n =*/ scanner.nextInt()
    val a = scanner.nextInt() - 1
    val b = scanner.nextInt() - 1
    val c = scanner.nextInt() - 1
    val d = scanner.nextInt() - 1
    val s = scanner.next()

    // 空がtrue 岩がfalse
    val course = s.map { it == '.' }

    val r: Parson   // ゴールとおいほう
    val l: Parson   // ゴールちかいほう

    if (c > d) {
        r = Parson(a, c, course)
        l = Parson(b, d, course)
    } else {
        r = Parson(b, d, course)
        l = Parson(a, c, course)
    }
    r.other = l
    l.other = r

    while (true) {
        val rc = r.location
        val lc = l.location
        while (!r.done()) {
            // ゴールするまで、進めるだけすすめる
            if (!r.forward()) break
        }
        // rが進めなくなったとき
        if (!l.done()) {
            // lがゴールしてなくて進める場合は一回進める
            l.forward()
        }
        if (r.done() && l.done()) {
            // できた
            print("Yes")
            return
        } else if (rc == r.location && lc == l.location) {
            // 進捗なし
            print("No")
            return
        }
    }
}

data class Parson(var location: Int, private val goal: Int, private val course: List<Boolean>) {
    lateinit var other: Parson

    private fun looksEmpty(target: Int): Boolean {
        return course[target] && other.location != target
    }

    // 移動出来たらtrue
    fun forward(): Boolean {
        if (looksEmpty(location + 1)) {
            location++
            return true
        } else if (looksEmpty(location + 2)) {
            location += 2
            return true
        }
        return false
    }

    fun done(): Boolean {
        return location == goal
    }
}