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++14 (GCC 5.4.1) (judge verdict: Wrong Answer)

#include <iostream>
#include <stdio.h>
#include <string>

  std::pair <int, int> start;
  std::pair <int, int> end;
  int roadLength;
  std::string road;

int max(int a, int b) {
  return (a > b) ? a : b;
}

int min(int a, int b) {
  return (a < b) ? a : b;
}

signed main() {
  std::cin >> roadLength >> start.first >> start.second >> end.first >> end.second;
  std::cin >> road;
  
  bool empty3 = false;

  // if (start.first < end.first || start.second < end.second) {
  //   std::cout << "No";
  //   return 0;
  // }

  if (end.first == end.second) {
    std::cout << "No";
    return 0;
  }

  for (int i = min(start.first, start.second); i <= max(end.first, end.second); ++i) {
    if (road[i] == '#' && road[i - 1] == '#') {
      std::cout << "No";
      return 0;
    }
    if (road[i] == '.' && road[i + 1] == '.' && road[i - 1] == '.' && i <= min(end.first, end.second) && i >= max(start.first, start.second))
      empty3 = true;
  }
  
  // std::cout << empty3 << " " << true << " " << false << "\n";

  if (start.first > start.second && end.first > end.second) {
    std::cout << "Yes";
  } else if (start.first < start.second && end.first < end.second) {
    std::cout << "Yes";
  } else if (empty3) {
    std::cout << "Yes";
  } else {
    std::cout << "No";
  }
}