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: Time Limit Exceeded)

n, a, b, c, d = gets.chomp.split(" ")
s = gets.chomp.split("")
a,b,c,d = a.to_i, b.to_i, c.to_i, d.to_i

s[a-1] = "A"
s[b-1] = "B"

def forward(s, tag="A", aim)
  locate = s.index(tag)
  flag = "can"
  if s[locate+1] == "."
    s[locate+1] = tag
    s[locate] = "."
  elsif s[locate+2] == "."
    s[locate+2] = tag
    s[locate] = "."
  else
    flag = "cant"
  end
  if s.index(tag) == (aim-1)
    flag = "reached"
  end
  return flag
end

if c > d
  fir = ["A", c]
  sec = ["B", d]
else
  fir = ["B", d]
  sec = ["A", c]
end

flag = "can"
#while s.index(fir[0]) < (fir[1]-1) && flag == "can"
while flag == "can"
  while flag == "can" && s.index(fir[0]) < (fir[1]-1)
    flag = forward(s, fir[0], fir[1])
  end
  flag = forward(s, sec[0], sec[1])
end
#flag = "can"
#while flag == "can"
#    flag = forward(s, sec[0], sec[1])
#end

if s.index("A") >= (c-1) && s.index("B") >= (d-1)
 puts "Yes"
else
 puts "No"
end