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 (GCC 5.4.1) (judge verdict: Accepted)

#include <stdio.h>
#include <stdint.h>
#include <inttypes.h>
#include <stdlib.h>

char S[200000];

int one_move(int *p, int *o, int target)
{
  int P = *p;
  int O = *o;

//  printf("P=%d target=%d\n", P, target);

  if (P < (target - 1)) {
    if (((P+2) != O) &&
        (S[P+2] == '.')) {
      P += 2;
      *p = P;
//      printf("P=%d target=%d (moved)\n", P, target);
      return 0;
    }
  }

  if (P < (target - 0)) {
    if (((P+1) != O) &&
        (S[P+1] == '.')) {
      P += 1;
      *p = P;
//      printf("P=%d target=%d (moved)\n", P, target);
      return 0;
    }
  }
  return 1;
}

int move_to_wait(int *p, int *o, int target)
{
  int P = *p;
  int O = *o;

//  printf("P=%d target=%d\n", P, target);

  while (1) {
    if ((S[P - 1] == '.') && (S[P + 1] == '.')) return 0;

    if (P < (target - 0)) {
      if (((P+1) != O) &&
          (S[P+1] == '.')) {
        P += 1;
        *p = P;
//        printf("P=%d target=%d (moved)\n", P, target);
        continue;
      }
    }
    if (P < (target - 1)) {
      if (((P+2) != O) &&
          (S[P+2] == '.')) {
        P += 2;
        *p = P;
//        printf("P=%d target=%d (moved)\n", P, target);
        continue;
      }
    }
    
    break;
    
  }//while

  return 1;
}

int main()
{
  int cnt;
  int i;
  int N,A,B,C,D;
  int comp = 0;
  int ret;

  cnt = scanf("%d %d %d %d %d", &N, &A, &B, &C, &D);
  cnt = scanf("%s", S);
//  printf("%s\n", S);
  A--;
  B--;
  C--;
  D--;

  if (C > D) {
    move_to_wait(&B, &A, D);
  }

  while (comp == 0) {
    if ((A == C) && (B == D)) {
      printf("Yes");
      return 0;
    }

    if (A < C) {
      ret = one_move(&A, &B, C);
      if (ret == 0) continue;
      ret = one_move(&B, &A, D);
      if (ret == 0) continue;
      printf("No");
      return 0;
    }

    if (B < D) {
      ret = one_move(&B, &A, D);
      if (ret == 0) continue;
      ret = one_move(&A, &B, C);
      if (ret == 0) continue;
      printf("No");
      return 0;
    }

  }// while

  printf("No");

  return 0;
}