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: Wrong Answer)

#include <stdio.h>
#include <stdint.h>
#include <stdbool.h>
#include <string.h>
#define MAX(a,b) ((a > b) ? a : b)
#define MIN(a,b) ((a < b) ? a : b)
#define ABS(a) ((a >= 0) ? a : -(a))

#define MAX_N 200000
int N;
char S[MAX_N];
static char memo[MAX_N];

bool search(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(memo[i-1] != 0) {
    return (memo[i-1] == 1) ? true : false;
  }
  if(S[i-1] == '#') return false;
  if(i == j) return true;
  bool ret0 = search(i+1, j);
  bool ret1 = search(i+2, j);
  if(ret0 == true || ret1 == true) {
    memo[i-1] = 1;
    return true;
  } else {
    memo[i-1] = 2;
    return false;
  }
}

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

  if(C > D) {
    bool two = false;
    for(int i = (B+1); i < (D-1); i++) {
       if(S[i-1] == '.' && S[i] == '.'){
	two = true;
	break;
      }
    }

    if(two == false) {
      printf("No\n");
      return 0;
    }
    int tmp = C;
    C = D;
    D = tmp;
  }
  
  // funuke
  bool ret = search(B, D);
  if(ret == false) {
    printf("No\n");
    return 0;
  }

  // sunuke
  ret = search(A, C);
  if(ret == false) {
    printf("No\n");
    return 0;
  }
  
  printf("Yes\n");
  return 0;
}