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 PHP7 (7.0.15) (judge verdict: Wrong Answer)

<?php
/**
 * AGC034
 * A - Kenken Race
 */

// $s = trim(fgets(STDIN));
// fscanf(STDIN, "%d %d", $a, $b);
// $n = array_map('intval', explode(' ', trim(fgets(STDIN))));

fscanf(STDIN, "%d %d %d %d %d", $n, $a, $b, $c, $d);
$s = trim(fgets(STDIN));

$dp_sunuke[$a] = (($s[$a - 1] ?? false) == '.');
$dp_funuke[$b] = (($s[$b - 1] ?? false) == '.');

if ($dp_sunuke[$a] == false or $dp_funuke[$b] == false) {
    echo 'No', PHP_EOL;
    exit;
}
if ($c > $n or $d > $n) {
    echo 'No', PHP_EOL;
    exit;
}

$funuke_ok = [];
$sunuke_ok = [];

//echo 'funuke', PHP_EOL;
//echo $b, ':', $dp_funuke[$b], PHP_EOL;
for ($i = $b + 1; $i <= $d; $i++) {
    $dp_funuke[$i] = (($s[$i - 1] ?? false) == '.') and (($dp_funuke[$i - 1] ?? false) or ($dp_funuke[$i - 2] ?? false));
    //echo $i, ':', $dp_funuke[$i], PHP_EOL;
    $funuke_ok[] = $i;
}

//echo 'sunuke', PHP_EOL;
//echo $a, ':', $dp_sunuke[$a], PHP_EOL;
for ($i = $a + 1; $i <= $c; $i++) {
    $dp_sunuke[$i] = (($s[$i - 1] ?? false) == '.') and (($dp_sunuke[$i - 1] ?? false) or ($dp_sunuke[$i - 2] ?? false));
    //echo $i, ':', $dp_sunuke[$i], PHP_EOL;
    $sunuke_ok[] = $i;
}

$flag = true;
for ($i = max($a, $b); $i <= min($c, $d) - 2; $i++) {
    if (($dp_funuke[$i]) and ($dp_funuke[$i + 1]) and ($dp_funuke[$i + 2])) {
        //echo '!!!', $i, PHP_EOL;
        $flag = false;
        break;
    }
    if (($dp_sunuke[$i]) and ($dp_sunuke[$i + 1]) and ($dp_sunuke[$i + 2])) {
        //echo '!!!', $i, PHP_EOL;
        $flag = false;
        break;
    }
}

if ($flag) {
    if (count(array_diff($funuke_ok, $sunuke_ok)) == 0 or count(array_diff($sunuke_ok, $funuke_ok)) == 0) {
        echo 'No', PHP_EOL;
        exit;
    }
}

if ($dp_sunuke[$c] and $dp_funuke[$d]) {
    echo 'Yes', PHP_EOL;
} else {
    echo 'No', PHP_EOL;
}