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>

using namespace std;
typedef long long ll;

int main() {
  ll N,A,B,C,D;
  cin>>N>>A>>B>>C>>D;
  string S;
  cin>>S;
  vector<ll> v(N + 1,0);
  for (ll i = 1; i <= S.size(); i++) {
    if (S[i] == '#') v[i] += v[i - 1] + 1;
    else v[i] = v[i - 1];
  }
  if (C < D) {
    for (ll i = B; i < D; i++) {
      if (S[i + 1] == '#' && S[i] == '#') {
          cout<<"No"<<endl;
          return 0;
      }
    }
    if (A > C) {
      cout<<"No"<<endl;
      return 0;
    }
    for (ll i = A; i <= C; i++) {
      if (S[i + 1] == '#' && S[i] == '#') {
        cout<<"No"<<endl;
        return 0;
      }
    }
    cout<<"Yes"<<endl;
    return 0;
  } else {
    S[B] = '#';
    ll org = B;
    for (ll i = A; i < C; i++) {
      if (S[i + 1] == '#' && S[i] == '#') {
        if (i + 1 != B && i != B) {
          cout<<"No"<<endl;
          return 0;
        } else {
            if (i + 4 > C) {
              cout<<"No"<<endl;
              return 0;
            }
            bool bad  = true;
            for (ll  j = i + 1; j <= C - 4; j++) {
              if (v[j + 3] == v[j]) {
                bad = false;
                break;
              }
            }
            if (bad) {
              cout<<"No"<<endl;
              return 0;
            }
        }
      }
    }
    S[org] = '.';
      if (B > D) {
        cout<<"No"<<endl;
        return 0;
      }
      for (ll i = B; i <= D; i++) {
        if (S[i + 1] == '#' && S[i] == '#') {
          cout<<"No"<<endl;
          return 0;
      }
    }
    cout<<"Yes"<<endl;
  }
  return 0;
}