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: Accepted)

def kenken(place, others, map)
  if(map[place + 1] == "." && place + 1 != others) then
    #puts 1
    return 1
  elsif(map[place + 2] == "." && place + 2 != others) then
    #puts 2
    return 2
  else
    #puts 0
    return 0
  end
end

  arr = gets.split(" ")
  map = gets
  n = arr.shift.to_i - 1
  a = arr.shift.to_i - 1
  b = arr.shift.to_i - 1
  c = arr.shift.to_i - 1
  d = arr.shift.to_i - 1

  if(d > c) then
    #puts "aaa"
    while(b <= n) do
      if(kenken(b, a, map) == 0) then
        puts "No"
        exit
      end
      b += kenken(b, a, map)
#      puts "b is"
#      puts b
      if(b == d) then
        while(a <= c) do
          if(kenken(a, b,map) == 0) then
            puts "No"
            exit
          end
          a += kenken(a, b, map)
#          puts "a is"
#          puts a
          if(a == c) then
            puts "Yes"
            exit
          end
        end
      end
    end
    puts "Error"
    exit
  else
#    puts "bbb"
    while(a <= n) do
      while(kenken(a, b, map) != 0) do
        a += kenken(a, b, map)
#        puts "a is"
#        puts a
        if(a == c) then
          puts "Yes"
          exit
        end
      end
      if(kenken(b, a, map) != 0 && b != d) then
        b += kenken(b, a, map)
#        puts "b is"
#        puts b
      else
        puts "No"
        exit
      end
    end
  end
  puts "Error"
  exit