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.15.1) (judge verdict: Wrong Answer)

use std::io::*;
use std::str::FromStr;

fn parse_line<T: FromStr>() -> T {
    let mut s = String::new();
    stdin().read_line(&mut s).ok();
    s.trim().parse().ok().unwrap()
}

fn parse_line_vec<T: FromStr>() -> Vec<T> {
    let line = parse_line::<String>();
    line.split_whitespace()
        .map(|s| s.parse().ok().unwrap())
        .collect()
}

fn println<T: std::string::ToString>(s: T) {
    println!("{}", s.to_string());
}

// ------------------------------------------------------------------------

fn main() {
    let input = parse_line_vec::<usize>();
    let n = input[0];
    let a = input[1] - 1; // zero-origin
    let b = input[2] - 1;
    let c = input[3] - 1;
    let d = input[4] - 1;

    let mut s = Vec::with_capacity(n + 1);
    let stdin = stdin();
    stdin.lock().read_until(b'\n', &mut s).unwrap();

    const SPACE: u8 = b'.';
    const ROCK: u8 = b'#';

    let need_overtake = c > d;
    let mut can_overtake = false;

    let mut before_last = s[a];
    let mut before = s[a + 1];

    for index in a + 2..std::cmp::max(c, d) {
        let current = s[index];

        if current == ROCK && before == ROCK {
            println("No");
            return;
        }

        if index > b && index < c && current == SPACE && before == SPACE && before_last == SPACE {
            can_overtake = true;
        }

        before_last = before;
        before = current;
    }

    let ok = !need_overtake || can_overtake;

    println(if ok { "Yes" } else { "No" });
}