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 Java8 (OpenJDK 1.8.0) (judge verdict: Wrong Answer)

import java.util.*;
public class Main{
  public static void main(String[] args){
    Scanner sc = new Scanner(System.in);
    int N = sc.nextInt();
    int A = sc.nextInt();
    int B = sc.nextInt();
    int C = sc.nextInt();
    int D = sc.nextInt();
    String S = sc.next();
    //C<Dならば、ふぬけが先に動いて到達できるか、そのあとすぬけが到達できるかを考えればよい

    if(C<D){
      if(!isDoubleStone(S,B,D)&&!isDoubleStone(S,A,C)){
        System.out.println("Yes");
        return;
      }else{
        System.out.println("No");
        return;
      }
    }
      
    //C>Dならば、BからDの間で、ふぬけがすぬけに追い越させる隙間が必要
    if(C>D){
      if(!isTripleSpace(S,B,D)){
        System.out.println("No");
        return;
      }
      //隙間があるならあとは到達できるかを独立して考える
      if(!isDoubleStone(S,B,D)&&!isDoubleStone(S,A,C)){
        System.out.println("Yes");
        return;
      }else{
        System.out.println("No");
        return;
      }
    }
  }
  //nからmの間に2連続で石が置いてあるか確認するメソッド
  public static boolean isDoubleStone(String S,int n,int m){
    for(int i=n-1;i<m-1;i++){
      if(S.substring(i,i+2).equals("##")){
        return true;
      }
    }
    return false;
  }
  
  //nからmの間に3連続で隙間が空いているか確認するメソッド
  public static boolean isTripleSpace(String S,int n,int m){
    for(int i=n-1;i<m-2;i++){
      if(S.substring(i,i+3).equals("...")){
        return true;
      }
    }
    return false;
  }
  

  
}