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::str::{
    FromStr,
};
use std::io::{ BufRead };

fn main() {
    let stdin = std::io::stdin();
    let mut t = Tokenizer::new(stdin.lock().lines().map(|x| x.unwrap()));

    let _n = t.take::<usize>();
    let a = t.take::<usize>();
    let b = t.take::<usize>();
    let c = t.take::<usize>();
    let d = t.take::<usize>();
    let s: Vec<char> = t.take::<String>().chars().collect();
    if !check( &s, a, c ) || !check( &s, b, d ) {
        println!("No");
        return;
    }
    if c < d || c < b {
        println!("Yes");
        return;
    }
    if check2( &s, b, d ) {
        println!("Yes");
        return;
    }
    println!("No");
}

fn check2( s: &Vec<char>, a: usize, b:usize ) -> bool {
    for i in a-1 .. b-1 {
        if s[i] == '.' && s[i-1] == '.' && s[i+1] == '.' {
            return true
        }
    }
    false
}

fn check( s: &Vec<char>, a: usize, b:usize ) -> bool {
    for i in a .. b-1 {
        if s[i] == '#' && s[i-1] == '#' {
            return false
        }
    }
    true
}

struct Tokenizer<S: Iterator<Item = String>>  {
    input: S,
    items: Vec<String>,
}

impl<S: Iterator<Item = String>> Tokenizer<S> {
    pub fn new( input: S ) -> Self {
        Tokenizer { input: input, items: Vec::new() }
    }

    pub fn take<T: FromStr>(&mut self) -> T {
        loop {
            if let Some(r) = self.items.pop() {
                return r.parse().ok().expect("parse failed");
            }
            let mut items = self.input.next().unwrap().split_whitespace().map(|x| x.to_string()).collect::<Vec<String>>();
            items.reverse();
            self.items = items;
        }
    }
}