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)

N, A, B, C, D = gets.chomp.split(' ').map(&:to_i)
S = (gets.chomp)[0 .. N]

Walks = 0.upto(S.size-2).map do |i|
    next -2 if S[i..i+1] == "##"
    next -1 if S[i..i+1] == "#."
    next  1 if S[i..i+1] == ".#"
    next  3 if S[i..i+2] == "..."
    2
end

def can_goal(start, goal)
    m = Walks[start-1 .. goal-2]

    return !m.any? { |i| i == -2 }
end

def can_wait(start, goal)
    m = Walks[start-1 .. goal-2]
    return true if S[start-2] == "." && S[start] == "."
    return false if m.any? { |i| i == -2 }
    return m.any? { |i| i == 3 }
end

pos  = C > D ? [ A, B ] : [ B, A ]
goal = C > D ? [ C, D ] : [ D, C ]

result = lambda do
    if pos[0] < pos[1]
        return false if not can_wait(pos[1], goal[1])
        return can_goal(pos[0], goal[0]) && can_goal(pos[1], goal[1])
    end
    if can_goal(pos[0], goal[0])
        return true if can_goal(pos[1], goal[1])
    end
    return false
end.call

puts result ? "Yes" : "No"