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 Ruby (2.3.3) (judge verdict: Wrong Answer)

N, A, B, C, D = gets.chomp.split(" ").map(&:to_i)
s = []
s = gets.chomp.split("")

# すぬけ君の初期位置と可能性
sunuke = {:name => "sunuke", :point => A - 1, :able => nil, :goal => C - 1}
# ふぬけ君の初期位置と可能性
funuke = {:name => "funuke", :point => B - 1, :able => nil, :goal => D - 1}


$batton = nil

def kenken(walker, stopping, s)
  if walker[:point] == walker[:goal] then
    # p "able true"
    # p walker[:name]
    walker[:able] = true
    true
  elsif (walker[:point] + 1 == stopping[:point] && s[walker[:point] + 2] == "#"  || \
        walker[:point] + 2 == stopping[:point] && s[walker[:point] + 1] == "#") && \
        stopping[:point] != stopping[:goal] && $batton then
    $batton = true
    true

  elsif walker[:point] > 0 && $batton \
        && s[walker[:point] - 1] == "." && s[walker[:point] + 1] == "." then
    $batton = false
    # p walker[:name]
    # p "..."
    true
  elsif s[walker[:point] + 1] == "." && walker[:point] + 1 != stopping[:point] then
    walker[:point] += 1
    $batton = true
    # p walker[:name]
    # p walker[:point] + 1
    false
  elsif s[walker[:point] + 2] == "." && walker[:point] + 2 != stopping[:point] then
    walker[:point] += 2
    $batton = true
    # p walker[:name]
    # p walker[:point] + 1
    false
  else
    #$batton = false
    walker[:able] = false
    # p "able false"
    # p walker[:name]
    false
  end
end

until sunuke[:able] && funuke[:able] do
  if kenken(funuke, sunuke, s) then
    if kenken(sunuke, funuke, s) then
      kenken(funuke, sunuke, s)
    end
  end
  if sunuke[:able] == false || funuke[:able] == false
    break
  end
end

if sunuke[:able] && funuke[:able] then
  puts "Yes"
else
  puts "No"
end