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: Runtime Error)


class Agc034A
  def self.input()
    n, a, b, c, d = gets.split(/\s+/)
    line_map = gets()[0..n.to_i]
    [a, b, c, d, line_map]
  end

  def self.output(result)
    puts (result ? "Yes": "No")
  end

  def self.non_duplicated_zone_check(start_i, end_i, line_map)
    part_of_line_map = line_map.slice(start_i, end_i)
    line_map[start_i] == '.' && line_map[end_i] == '.' && !part_of_line_map.match(/##/)
  end

  def self.duplicated_zone_check(start_i, end_i, line_map, need_reverse)
    part_of_line_map = line_map[start_i..end_i]
    !part_of_line_map.match(/##/) &&
        (!need_reverse || !!part_of_line_map.match(/\.\.\./))
  end

  def self.have_duplicated_zone_calc(a,b,c,d,line_map)
    non_duplicated_zone_check([a,b].min,[a,b].max,line_map) &&
        non_duplicated_zone_check([a,b].min,[c,d].max,line_map) &&
        duplicated_zone_check([a,b].max,[c,d].min, line_map, d <= c)


  end

  def self.calc(a, b, c, d, line_map)
    a_i = a - 1
    b_i = b - 1
    c_i = c - 1
    d_i = d - 1
    return non_duplicated_zone_check(a_i,c_i,line_map) && non_duplicated_zone_check(b_i,d_i,line_map) if (c_i < b_i)
    return have_duplicated_zone_calc(a_i, b_i, c_i, d_i,line_map)
  end

  def self.main()
    a, b, c, d, line_map = input()
    result = calc(a,b,c,d,line_map)
    output(result)
  end
end

Agc034A.main