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)

# util functions

# debug
$debugFlag = ( ARGV[0] != nil )
p "==== DEBUG MODE ====" if $debugFlag

def pd(str)
  p str if $debugFlag
end

# input
inputs = []
lc = 0
while l = $stdin.gets do
  if lc == 1
    inputs << l.chomp.split(" ").map(&:to_s)
  else
    inputs << l.chomp.split(" ").map(&:to_i)
  end
  lc += 1
end

# input check
if $debugFlag
  p "--- INPUT (begin) ---"
  inputs.each do |l_i|
    p l_i
  end
  p "--- INPUT (end) ---"
  print "\n"
end

nn = inputs[0][0]
aa = inputs[0][1]-1
bb = inputs[0][2]-1
cc = inputs[0][3]-1
dd = inputs[0][4]-1
rd = inputs[1][0]

# body
if $debugFlag
  p nn
  p aa
  p bb
  p cc
  p dd
  p rd
end

def can_goal?(chk)
  return false if chk[-1] == '#'
  ans = true
  (chk.length-1).times do |i|
    if chk[i..i+1] == "##"
      ans = false
      break
    end
  end
  return ans
end

bb_goals_first = false
tmp = can_goal?(rd[bb+1..dd])
if tmp
  chk = rd.clone
  chk[dd] = '#'
  bb_goals_first = can_goal?(chk[aa+1..cc])
end

bb_goals_last = false
aa_ovtk_bb = false
(rd[bb..dd].length-2).times do |i|
  if rd[i..i+2] == '...'
    aa_ovtk_bb = true
    break
  end
end

if aa_ovtk_bb
  tmp = can_goal?(rd[aa+1..cc])
  if tmp
    chk = rd.clone
    chk[cc] = '#'
    bb_goals_last = can_goal?(chk[bb..dd])
  end
end

if bb_goals_first or bb_goals_last
  puts "Yes"
else
  puts "No"
end