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 Haskell (GHC 7.10.3) (judge verdict: Accepted)

import qualified Data.Text as T
import qualified Data.Text.IO as T
import qualified Data.Text.Read as T
import Data.Bool (bool)

main :: IO ()
main = do
  (_ : a : b : c : d : _) <- map unsafeSignedDecimal . T.words <$> T.getLine :: IO [Int]
  s <- T.getLine :: IO T.Text
  putStrLn . bool "No" "Yes" . solve a b c d $ s

solve a b c d s | c < d = check1 b d s && check1 a c s
                | otherwise = check1 b d s && check2 b d s && check1 a c s

check1 :: Int -> Int -> T.Text -> Bool
check1 a c s = fst . foldl step (True, False) . map T.length . T.group . T.take (c - (pred a)) . T.drop (pred a) $ s
  where
    step (True, False) _ = (True, True)
    step (True, True) l = (l <= 1, False)
    step p _ = p

check2 :: Int -> Int -> T.Text -> Bool
check2 b d s = fst . uncurry (foldl step . (,) False) . ((,) <$> (<= 1) . head <*> id) . map T.length . T.group . T.take (d - b + 3) . T.drop (pred $ pred b) $ s
  where
    step (False, True) _ = (False, False)
    step (False, False) l = (3 <= l, True)
    step p _ = p

unsafeSignedDecimal :: T.Text -> Int
unsafeSignedDecimal s = case T.signed T.decimal s of
  Right (n, _) -> n