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.

Examples

Input

7 1 3 6 7
.#..#..


Output

Yes


Input

7 1 3 7 6
.#..#..


Output

No


Input

15 1 3 15 13
...#.#...#.#...


Output

Yes
#include <bits/stdc++.h>
using namespace std;

int main() {
  int N,A,B,C,D,Z=0;
  cin>>N>>A>>B>>C>>D;
  string S;
  cin>>S;
  for(int i=A;i<max(C,D);i++){
    if(S.at(i)=='#'&&S.at(i-1)=='#'){
      Z++;
      break;
    }
  }
  if(D<C){
    Z++;
    for(int i=B;i<=D;i++){
      if(S.at(i)=='.'&&S.at(i-1)=='.'&&S.at(i-2)=='.'){
        Z--;
        break;
      }
    }
  }
  if(Z==0){
    cout<<"Yes"<<endl;
  }
  else{
    cout<<"No"<<endl;
  }
}