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<bits/stdc++.h>
#define endl '\n'
typedef long long int ll;
int flag=0;

using namespace std;
ll arr[300000];
void rec(ll i,ll d){
    if(arr[i+1]==1 && arr[i+2]==1) { flag=2; return ; }
    if(flag==1 || flag==2) return ;
    if(arr[i]==1) return ;
    if(i>d) return;
    if(i==d) flag=1;
    rec(i+2,d);
    rec(i+1,d);
}
int main()
{
  
  ll n,a,b,c,d;
  string s;
  cin>>n>>a>>b>>c>>d;
  cin>>s;
  for(int i=0;i<s.size();i++){
      if(s[i]=='#') arr[i+1]=1;
  }
//   for(int i=1;i<=n;i++) cout<<arr[i]<<" ";
//   cout<<endl;
  rec(b,d);
  if(flag==0 || flag==2) {cout<<"NO"<<endl; return 0; }
  arr[c]=0;
  arr[d]=1;
  flag=0;
  rec(a,c);
   if(flag==0 || flag==2) {
       arr[d]=0;
        for(int i=a+1;i<=d-2;i++){
            // cout<<arr[i]<<" ";
            if(arr[i]==0 &&  arr[i+1]==0  && arr[i+2]==0) {cout<<"YES"<<endl; return 0; }
            
        }
        cout<<"NO"<<endl; 
    }
   else cout<<"YES"<<endl;
}