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 Rust (1.42.0) (judge verdict: Wrong Answer)

#[allow(unused_imports)]
use proconio::marker::{Bytes, Chars, Usize1};
use proconio::{fastout, input};
#[fastout]
fn main() {
    input! {
        _: usize,
        a: usize,
        b: usize,
        c: usize,
        d: usize,
        s: Chars,
    }
    if c > d {
        // c > dのとき、aがbを追い越すことになる。
        // 追い越すことができる条件は、b < d の間に岩のない空間が最小3つ連続していること。
        if between(b, d, &s) != true {
            println!("No");
            return;
        }
    }
    // そのタイミングでaはbを追いこすことができ、
    // そこからa, bのがそれぞれゴールにたどり着けるかどうかを判定する
    if goal(b, d, &s) == true && goal(a, c, &s) == true {
        println!("Yes");
    } else {
        println!("No");
    }
}
// ゴールにたどり着ける条件は、現在いる地点からゴールの間に岩のない空間が2つ連続しないこと
fn goal(start: usize, goal: usize, map: &Vec<char>) -> bool {
    for i in start - 1..goal {
        if map[i] == '.' || i == goal - 1 {
            continue;
        } else if map[i + 1] == '#' {
            return false;
        }
    }
    true
}

fn between(b: usize, d: usize, map: &Vec<char>) -> bool {
    let mut ret = 0;
    for i in b - 1..d {
        if map[i] == '.' {
            ret += 1;
        } else {
            ret = 0;
        }
        if ret == 3 {
            return true;
        }
    }
    false
}