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++14 (GCC 5.4.1) (judge verdict: Wrong Answer)

#include <iostream>
#include <utility>
using namespace std;

inline bool IsMovable(const string& s, int idx, int x){
  if (idx+x>=s.size()) return false;
  return s[idx+x]=='.';
}

bool F(string& s, int& idx, char c, int target){
  if (IsMovable(s,idx,1)){
    s[idx]='.'; idx++; s[idx]=c;
    return true;
  }
  else if (IsMovable(s,idx,2) && (idx+1!=target)){
    s[idx]='.'; idx+=2; s[idx]=c;
    return true;
  }
  else
    return false;
}

int main(){
  int N,A,B,C,D;
  cin>>N>>A>>B>>C>>D;
  A--;
  B--;
  C--;
  D--;
  
  string s;
  cin>>s;
  s[A]='A';
  s[B]='B';
  
  bool is_capable=true;
  bool A_reached = false;
  bool B_reached = false;
  bool A_can_move=true;
  bool B_can_move=true;
  while(1){
    if(C>D){
      A_reached=A==C;
      B_reached=B==D;
      if (!A_reached)
      	A_can_move = F(s, A, 'A', C);
      if (!B_reached && (A_reached || !A_can_move)){
        B_can_move = F(s, B, 'B', D);
      }
    }
    else{
      A_reached=A==C;
      B_reached=B==D;
      if (!B_reached)
      	B_can_move = F(s, B, 'B', D);
      if (!A_reached && (B_reached || !B_can_move)){
        A_can_move = F(s, A, 'A', C);
      }
    }
          cout <<s<<endl;
    
    if (A_reached && B_reached){
      is_capable = true;
      break;
    }
    else if(A_reached&&!B_can_move){
      is_capable=false;
      break;
    }
    else if(B_reached&&!A_can_move){
      is_capable=false;
      break;
    }
    else if (!A_can_move && !B_can_move){
      is_capable=false;
      break;
    }
  }
  cout<< (is_capable?"Yes":"No")<<endl;
  return 0;
}