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;
 
int findRock (string s, int find)
{
  if (s[find] == '#') return 1;
  else return 0;
}

int test_A(int a, int b, int c, int d, string s)
{
  int ONE_STEP = 1;
  int TWO_STEP = 2;
  
  if (findRock(s, a) == 1)
  {
    return 1;
  }
  if (a == c)
  {
    return 0;
  }

  while (a < c)
  {
    if (findRock(s, a + TWO_STEP) == 0) 
    {
      a += TWO_STEP;
    }
    else if (findRock(s, a + ONE_STEP) == 0)
    {
      a += ONE_STEP;
    }
    else
    {
      return 1;
    }
    
    if (a == c)
    {
      return 0;
    }

    if (a > c)
    {
      return 1;
    }
  }

}

int test_B(int a, int b, int c, int d, string s)
{
  int ONE_STEP = 1;
  int TWO_STEP = 2;
  
  if (findRock(s, b) == 1)
  {
    return 1;
  }
  else if (b == d)
  {
    return 0;
  }

  while (b < d)
  {
    if (findRock(s, b + TWO_STEP) == 0) 
    {
      b += TWO_STEP;
    }
    else if (findRock(s, b + ONE_STEP) == 0)
    {
      b += ONE_STEP;
    }
    else
    {
      return 1;
    }
    
    if (b == d)
    {
      return 0;
    }
    if (b > d)
    {
      return 1;
    }
  }

}

int main()
{
  int n, a, b, c, d;
  string s;
  cin >> n >> a >> b >> c >> d;
  cin >> s;
  a--;
  b--;
  c--;
  d--;

  // Bから判定
  if (test_B(a, b, c, d, s) == 0) { }
  else if (test_B(a, b++, c, d, s) == 0) { }
  else
  {
    cout << "No" << endl;
    return 0;
  }
  // BがパスしたらAを判定
  if (test_A(a, b, c, d, s) == 0) { cout << "Yes" << endl; }
  else if (test_A(a++, b, c, d, s) == 0) { cout << "Yes" << endl; }
  else
  {
    cout << "No" << endl;
    return 0;
  }
}