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 C# (Mono 4.6.2.0) (judge verdict: Wrong Answer)

using System;
using System.ComponentModel;
using System.Linq;

namespace AtCoder_Grand_Contest_034 {
	class Program {
		static void Main(string[] args) {
			var input = Helper<int>.ReadLine();
			var n = input[0];
			var a = input[1];
			var b = input[2];
			var c = input[3];
			var d = input[4];
			var road = Helper<string>.Read(1)[0];

			var existsLongTrapForA = false;
			for (int index = a; index < c - 1; index++) {
				if (road[index] == '#' && road[index + 1] == '#') {
					existsLongTrapForA = true;
					break;
				}
			}

			if (existsLongTrapForA) {
				Console.WriteLine("No");
				return;
			}

			var existsLongTrapForB = false;
			for (int index = b; index < d - 1; index++) {
				if (road[index] == '#' && road[index + 1] == '#') {
					existsLongTrapForB = true;
					break;
				}
			}

			if (existsLongTrapForB) {
				Console.WriteLine("No");
				return;
			}

			if (c < d) {
				Console.WriteLine("Yes");
				return;
			}

			var canJump = false;
			for (int index = b; index < c - 1; index++) {
				if (index < 0) {
					continue;
				}
				if (road[index - 1] == '.' && road[index] == '.' && road[index + 1] == '.') {
					canJump = true;
					break;
				}
			}

			if (canJump) {
				Console.WriteLine("Yes");
				return;
			}

			Console.WriteLine("No");
		}
	}

	public static class Helper<T> {
		public static T[] Read(int count) {
			var result = new T[count];
			for (int index = 0; index < count; index++) {
				result[index] = (T)TypeDescriptor.GetConverter(typeof(T)).ConvertFromString(Console.ReadLine());
			}
			return result;
		}

		public static T[] ReadLine() {
			var input = Console.ReadLine();
			var inputs = input.Split(' ');
			var result = new T[inputs.Count()];
			for (int index = 0; index < inputs.Count(); index++) {
				result[index] = (T)TypeDescriptor.GetConverter(typeof(T)).ConvertFromString(inputs[index]);
			}
			return result;
		}
	}
}