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)

// Try AtCoder
// author: Leonardone @ NEETSDKASU

fn main() {
  let mut stdin = String::new();
  std::io::Read::read_to_string(
    &mut std::io::stdin(),
    &mut stdin).unwrap();
  let mut stdin = stdin.split_whitespace();
  let mut get = || stdin.next().unwrap();
  macro_rules! get {
    ($t:ty) => (get().parse::<$t>().unwrap());
    () => (get!(i64));
  }
  
  let n = get!(usize);
  let a = get!(usize) - 1;
  let b = get!(usize) - 1;
  let c = get!(usize) - 1;
  let d = get!(usize) - 1;
  let s = get().as_bytes();
  
  let r = b'#';
  
  fn no() { println!("No"); }
  fn yes() { println!("Yes"); }
  
  for i in a .. c {
    if s[i]==r && s[i+1]==r {
      no(); return;
    }
  }
  for i in b .. d {
    if s[i]==r && s[i+1]==r {
      no(); return;
    }
  }
  if c < d {
    yes(); return;
  }
  
  let e = std::cmp::min(c, d);
  let m = b'.';
  for i in b-1 .. e {
  	if s[i]==m && s[i+1]==m && s[i+2]==m {
    	yes(); return;
    }
  }
  
  no();
}