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: Runtime Error)

#include <stdio.h>
#include <stdint.h>
#include <stdbool.h>
#include <string.h>

#define MAX_N 20001
int N, C, D;
char S[MAX_N];
static char memo0[MAX_N];

bool search0(int i, int j) {
  //printf("i=%d j=%d S[i-1]=%c\n", i, j, S[i-1]);
  if(i > j)  return false;
  if(memo0[i-1] != 0) {
    return (memo0[i-1] == 1) ? true : false;
  }
  if(S[i-1] == '#') return false;
  if(i == j) return true;
  
  bool ret0 = search0(i+1, j);
  bool ret1 = search0(i+2, j);
  if(ret0 == true || ret1 == true) {
    memo0[i-1] = 1;
    return true;
  } else {
    memo0[i-1] = 2;
    return false;
  }
}

bool search(int a, int b) {
  if(((a < b) && (C < D)) || ((b < a) && (D < C))) {
    bool ret0 = search0(a, C);
    bool ret1 = search0(b, D);
    return (ret0 && ret1);
  }
  if(a == b) return false;
  if(a > C)  return false;
  if(b > D)  return false;
  if((b < a) && (C < D)) return false;

  if(S[a-1] == '#') return false;
  if(S[b-1] == '#') return false;
  if(a == C && b == D) return true;

  if(search(a+1, b)) {
    return true;
  }
  if(search(a+2, b)) {
    return true;
  }
  if(search(a, b+1)) {
    return true;
  }    
  if(search(a, b+2)) {
    return true;
  }    

  return false;
}

int main(void) {
  int A, B;
  scanf("%d%d%d%d%d", &N, &A, &B, &C, &D);
  scanf("%s", S);

  if(search(A, B)) {
    printf("Yes\n");
  } else {
    printf("No\n");
  }
  return 0;
}