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)

// #[warn(dead_code)]
// const TOP: u64 = 1000000007;

pub struct Poper<'a> {
	iter: std::str::SplitWhitespace<'a>,
}

impl<'a> Poper<'a> {
	pub fn new(iter: std::str::SplitWhitespace) -> Poper {
		Poper { iter: iter }
	}
	pub fn read<T: std::str::FromStr>(&mut self) -> T
	where
		<T as std::str::FromStr>::Err: std::fmt::Debug,
	{
		self.iter.next().unwrap().parse().unwrap()
	}
}

// use std::collections::BTreeMap;

fn main() {
	let input = {
		use std::io::Read;
		let mut s = String::new();
		std::io::stdin().read_to_string(&mut s).unwrap();
		s
	};
	let mut iter = Poper::new(input.split_whitespace());

	let _: u64 = iter.read();
	let a: u64 = iter.read();
	let b: u64 = iter.read();
	let c: u64 = iter.read();
	let d: u64 = iter.read();

	let mapstring: String = iter.read();
	let map: Vec<char> = mapstring.chars().collect();

	if search(&map, 1, b - 1, d - 1, 0, 0) {
		let t: u64 = if d < c { 3 } else { 1 };
		if search(&map, t, a - 1, c - 1, b - 1, d - 1) {
			println!("Yes");
			return;
		}
	}
	println!("No");
}

fn search(map: &Vec<char>, length: u64, start: u64, end: u64, minc: u64, maxc: u64) -> bool {
	let mut cnt = 0;
	let mut f = true;
	let mut max = false;
	// println!("# {} {}", start, end);
	for i in (start as usize)..((end as usize) + 1) {
		let x = map[i];
		// println!("{} {}", i, x);
		if '.' == x {
			let j = i as u64;
			if maxc < j && 1 == cnt {
				f = false;
			}
			cnt += 1;
			if cnt >= length && ((minc < j && f) || 1 == length) {
				max = true;
			}
		} else {
			if 0 == cnt {
				return false;
			}
			let j = i as u64;
			if maxc < j {
				f = false;
			}
			// min = false;
			cnt = 0;
		}
	}
	max
}