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.Linq;

namespace ConsoleApp1
{
	class Program
	{
		static void Main(string[] args)
		{
			string input1 = Console.ReadLine();
			string input2 = Console.ReadLine();

			var splitedInput = input1.Split(new char[] { ' ' });

			int n = int.Parse(splitedInput[0]);
			int xStart = int.Parse(splitedInput[1]);
			int yStart = int.Parse(splitedInput[2]);
			int xGoal = int.Parse(splitedInput[3]);
			int yGoal = int.Parse(splitedInput[4]);

			var stops = Enumerable.Range(1, n).Select(number =>
			{
				int index = number - 1;
				bool stop;
				if (number == n)
				{
					stop = true;
				}
				else if (number == n - 1)
				{
					stop = input2[index + 1] == '#';
				}
				else
				{
					stop = input2[index + 1] == '#' && input2[index + 2] == '#';
				}

				return new { number, stop };
			}).
			Where(target => target.stop).
			Select(target => target.number).
			ToArray(); ;

			if (CanMove(xStart, xGoal, stops) == true && CanMove(yStart, yGoal, stops) == true)
			{
				Console.WriteLine("Yes");
			}
			else
			{
				Console.WriteLine("No");
			}
		}

		private static bool CanMove(int start, int goal, int[] stops) => stops.Any(target => start <= target && target < goal) == false;
	}
}