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::cmp::*;
use std::collections::*;
#[cfg(debug_assertions)]
include! {"./debug.rs"}

#[cfg(not(debug_assertions))]
macro_rules! debug {
    ($($arg:expr),*) => {};
}

macro_rules! read {
    ([$t:ident] ; $n:expr) =>
        ((0..$n).map(|_| read!([$t])).collect::<Vec<_>>());
    ([$t:ident]) =>
        (rl().split_whitespace().map(|w| read_type!(w, $t)).collect::<Vec<_>>());
    (_, [$t:ident] ; $n:expr) =>
        ((0..$n).map(|_| read!(_, [$t])).collect::<Vec<_>>());
    (_, [$t:ident]) =>
        (rl().split_whitespace().skip(1).map(|w| read_type!(w, $t)).collect::<Vec<_>>());
    ($($t:ident),+ ; $n:expr) =>
        ((0..$n).map(|_| read!($($t),+)).collect::<Vec<_>>());
    ($t:ident) => (read_type!(rl(), $t));
    ($($t:ident),*) => {{
        let buf = rl();
        let mut w = buf.split_whitespace();
        ($(read_type!(w.next().unwrap(), $t)),*)
    }};
}

macro_rules! read_type {
    ($s:expr, chars) => {
        $s.chars().collect::<Vec<char>>()
    };
    ($s:expr, usize1) => {
        read_type!($s, usize) - 1
    };
    ($s:expr, $t:ty) => {
        $s.parse::<$t>().unwrap()
    };
}

fn rl() -> String {
    let mut buf = String::new();
    std::io::stdin().read_line(&mut buf).unwrap();
    buf.trim_right().to_owned()
}

trait IteratorExt: Iterator + Sized {
    fn vec(self) -> Vec<Self::Item> {
        self.collect()
    }
}

impl<T: Iterator> IteratorExt for T {}

////////////////////////////////////////////////////////////////////////////////

fn main() {
    let (n, a, b, a_to, b_to) = read!(usize, usize1, usize1, usize1, usize1);
    let s = read!(chars);

    let ans = if a_to < b_to {
        let mut ok = true;
        for i in a..a_to - 2 {
            if s[i] == '#' && s[i + 1] == '#' && s[i + 2] == '#' {
                ok = false;
            }
        }
        for i in b..b_to - 2 {
            if s[i] == '#' && s[i + 1] == '#' && s[i + 2] == '#' {
                ok = false;
            }
        }
        ok
    } else {
        let mut ok = true;
        for i in a..a_to - 2 {
            if s[i] == '#' && s[i + 1] == '#' && s[i + 2] == '#' {
                ok = false;
            }
        }
        for i in b..b_to - 2 {
            if s[i] == '#' && s[i + 1] == '#' && s[i + 2] == '#' {
                ok = false;
            }
        }
        let mut jump = false;
        debug!(b - 1..b_to - 2);
        for i in b - 1..b_to - 1 {
            if s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.' {
                jump = true;
            }
        }
        let to = max(0, b_to as i32 - 2) as usize;
        debug!(to);
        for i in b - 1..to {
            if s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '#' && s[i + 3] == '.' {
                jump = true;
            }
        }
        for i in max(b as i32 - 2, 0) as usize..to {
            if s[i] == '.' && s[i + 1] == '#' && s[i + 2] == '.' && s[i + 3] == '.' {
                jump = true;
            }
        }
        ok && jump
    };

    println!("{}", if ans { "Yes" } else { "No" });
}