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>

void det(int n, int dp[n][n], int a, int b, int *rock){
  if(dp[a][b] != -1){return;}
  if(a == b){return;}
  if(a >= n || b >= n){return;}
  if(rock[a] || rock[b]){return;}
  dp[a][b] = 1;
  det(n, dp, a + 1, b, rock);
  det(n, dp, a + 2, b, rock);
  det(n, dp, a, b + 1, rock);
  det(n, dp, a, b + 2, rock);
  return;
}

/*
int check(int n, int dp[n][n], int a, int b, int *rock){
  return (a != b) && (a < n) && (b < n) && (!rock[a]) && (!rock[b]);
}

void det(int n, int dp[n][n], int a, int b, int *rock){
  int i, j;
  dp[a][b] = 1;
  for(i = 0; i < n; i++){
    for(j = 0; j < n; j++){
      if(dp[i][j]){
        if(check(n, dp, i + 1, j, rock)){dp[i + 1][j] = 1;}
        if(check(n, dp, i + 2, j, rock)){dp[i + 2][j] = 1;}
        if(check(n, dp, i, j + 1, rock)){dp[i][j + 1] = 1;}
        if(check(n, dp, i, j + 2, rock)){dp[i][j + 2] = 1;}
      }
    }
  }
  return;
}
*/
int main(){
  int n, a, b, c, d, i, j;
  char rc;
  scanf("%d, %d, %d, %d, %d", &n, &a, &b, &c, &d);
  a--;
  b--;
  c--;
  d--;
  int rock[n];
  for(i = 0; i < n; i++){
    scanf(" %c", &rc);
    rock[i] = (rc == '#');
  }
  int dp[200000][200000];
  for(i = 0; i < n; i++){
    for(j = 0; j < n; j++){
      dp[i][j] = 0;
    }
  }
  det(n, dp, a, b, rock);

  if(dp[c][d]){
    printf("YES\n");
  }else{
    printf("NO\n");
  }

  return 0;
}