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.*;
class Main {
  public static void main(String[] args) {
    Scanner stdIn = new Scanner(System.in);
    int n = stdIn.nextInt();
    int a = stdIn.nextInt();
    int b = stdIn.nextInt();
    int c = stdIn.nextInt();
    int d = stdIn.nextInt();
    a = a-1;
    b = b-1;
    c = c-1;
    d = d-1;
    String s = stdIn.next();
    int l = s.length();
    char[] e = new char[l];
    for(int i = 0;i<e.length;i++) {
      e[i] = s.charAt(i);
    }
    int k = 0;
    int t = 0;
    int count1 = 0;
    int count2 = 0;
    long save = 10000000;
    saiki(a,e,c,save,k,count1);
    saiki(b,e,d,save,t,count2);
    if(k==1&&t==1) {
      System.out.println("Yes");
    } else {
      System.out.println("No");
    }
  }
    static void saiki(int a,char[] e,int c,long save,int k,int count) {
      if(a==save) count = 1;
      if(a+1<e.length&&a!=c&&count!=1) {
        if(e[a+1]=='.') {
          if(a+1==c) {save = c;k=1;}
          saiki(a+1,e,c,save,k,count);
        }
      }
      if(a+2<e.length&&a!=c) {
        if(e[a+2]=='.') {
          if(a+2==c) {save = c;k=1;}
          saiki(a+2,e,c,save,k,count);
        }
      }
    }
  }