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: Accepted)

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

#[allow(dead_code)]
fn read<T: FromStr>() -> T {
    let stdin = stdin();
    let stdin = stdin.lock();
    let token: String = stdin
        .bytes()
        .map(|c| c.expect("failed to read char") as char)
        .skip_while(|c| c.is_whitespace())
        .take_while(|c| !c.is_whitespace())
        .collect();
    token.parse().ok().expect("failed to parse token")
}

fn one_move(ss: &mut Vec<usize>, gs: &Vec<usize>, field: &Vec<char>, i: usize) -> bool {
    for d in 1..3 {
        let npos = ss[i] + d;
        if npos <= gs[i] && field[npos] == '.' && npos != ss[i ^ 1] {
            ss[i] = npos;
            return true;
        }
    }
    return false;
}

fn main() {
    let _n = read::<i64>();
    let mut ss = vec![0; 2];
    let mut gs = vec![0; 2];
    for i in 0..2 {
        ss[i] = read::<usize>() - 1;
    }
    for i in 0..2 {
        gs[i] = read::<usize>() - 1;
    }
    let field = read::<String>().chars().collect::<Vec<char>>();
    if gs[0] < gs[1] {
        ss.swap(0, 1);
        gs.swap(0, 1);
    }
    for i in 0..2 {
        while ss[i] < gs[i] {
            if !one_move(&mut ss, &gs, &field, i) {
                if !one_move(&mut ss, &gs, &field, i ^ 1) {
                    println!("No");
                    return;
                }
            }
        }
    }
    println!("Yes");
}