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 read_bytes(length: usize, skip_next: bool) -> Vec<u8> {
    let mut bytes = vec![0; length];
    let stdin = stdin();
    let mut stdin = stdin.lock();
    stdin.read_exact(&mut bytes).unwrap();
    if skip_next {
        stdin.bytes().next();
    }
    bytes
}

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

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

#[derive(Copy, Clone)]
struct ConsecutiveBytes {
    unit_byte: u8,
    count: usize,
}

impl ConsecutiveBytes {
    fn new(unit_byte: u8) -> ConsecutiveBytes {
        ConsecutiveBytes {
            unit_byte: unit_byte,
            count: 0,
        }
    }

    fn count(&mut self, byte: u8) -> usize {
        if byte == self.unit_byte {
            self.count += 1;
        } else {
            self.count = 0;
        }

        self.count
    }
}

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

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

    let mut rocks = ConsecutiveBytes::new(b'#');

    for index in a..std::cmp::max(c, d) {
        if rocks.count(s[index]) >= 2 {
            println("No");
            return;
        }
    }

    if c < d {
        // does not need to overtake
        println("Yes");
        return;
    }

    let mut spaces = ConsecutiveBytes::new(b'.');

    for index in b - 1..d + 1 {
        if spaces.count(s[index]) >= 3 {
            println("Yes");
            return;
        }
    }

    println("No");
}