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

#![allow(unused, non_snake_case, dead_code, non_upper_case_globals)]
use {
    proconio::{marker::*, *},
    std::{cmp::*, collections::*, mem::*},
};

fn main() {
    input! {
        n:usize,a:Usize1,b:Usize1,c:Usize1,d:Usize1,
        s:Chars,
    }
    pub fn yn(ans: bool) {
        if ans {
            println!("Yes");
        } else {
            println!("No");
        }
    }
    if c < d {
        let mut dp = vec![false; n + 4];
        dp[a] = true;
        dp[b] = true;
        // dp[b] = true;
        // for i in b..n - 1 {
        //     dp[i + 1] = dp[i] && s[i + 1] == '.';
        //     if i + 2 < n {
        //         dp[i + 2] = dp[i] && s[i + 1] == '.';
        //     }
        // }
        for i in a..n - 1 {
            // dbg!(s[i + 1] == '.');
            dp[i + 1] |= dp[i] && (s[i + 1] == '.');
            if i + 2 < n {
                dp[i + 2] |= dp[i] && (s[i + 2] == '.');
                // dbg!(dp[i] && s[i + 2] == '.');
            }
        }
        // dbg!(&dp);
        yn(dp[c] && dp[d]);
    } else {
        let mut dp = vec![false; n + 4];
        dp[a] = true;
        // dp[b] = true;
        let mut tmp = false;
        for i in b..d {
            if s[i - 1] == '.' && s[i] == '.' && s[i + 1] == '.' {
                tmp = true;
            }
        }
        if !tmp {
            println!("No");
            return;
        }
        for i in a..n - 1 {
            dp[i + 1] |= dp[i] && (s[i + 1] == '.');
            if i + 2 < n {
                dp[i + 2] |= dp[i] && (s[i + 2] == '.');
            }
        }
        yn(dp[c] && dp[d]);
    }
}