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.Collections.Generic;
using System.Linq;
using System.Threading.Tasks;

namespace Miscelleneous {
	class Program {
		static int[] parins() {
			return Console.ReadLine().Split(' ').Select(s => int.Parse(s)).ToArray();
		}
		static int parin() {
			return int.Parse(Console.ReadLine());
		}
		static string read() { return Console.ReadLine(); }
		static void Main(string[] args) {
			var I = parins();
			int N = I[0], A = I[1]-1, B = I[2]-1, C = I[3]-1, D = I[4]-1;
			var S = read().Select(c => c == '#').ToArray();
			bool Res = !(HasWall(S, A, C) || HasWall(S, B, D));
			if (Res && C > D) Res = HasStation(S, B, D);
			Console.WriteLine(Res ? "Yes" : "No");
			read();
		}

		static bool HasWall(bool[] S,int start,int goal) {
			var phase = 0;
			for (var i = start; i <= goal; i++) {
				if (S[i]) {
					phase++;
					if (phase >= 2) return true;
				}
				else phase = 0;
			}
			return false;
		}
		static bool IsStation(bool[] S, int index) {
			return !S[index] && !S[index - 1] && !S[index + 1];
			//Remark the index is inner.
		}
		static bool HasStation(bool[] S,int fStart,int fGoal) {	
			var lake = 0;
			if (IsStation(S, fStart)) return true;
			for (int i = fStart; i < fGoal; i++) {
				if (!S[i]) {
					lake++; if (lake >= 3) return true;
				}
				else lake = 0;
			}
			if (IsStation(S, fGoal)) return true;
			return false;
		}

	}

}