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 Fortran (gfortran v4.8.4) (judge verdict: Runtime Error)

program kenken
 implicit none
 integer n, a, b, c, d
 integer i, p, q, r, sum
 character(20000) s
 read*, n, a, b, c, d
 read*, s
 p=0
 q=0
 r=0
 sum=0
 
 if (c < d) then
 
 do i=b, d-1
  p=index(s(i:i),"#")
  q=index(s(i+1:i+1),"#")
   if ((p+q).eq.2) then
   print*, "No"
   return
   end if
 end do
  s(d:d)="#"
  do i=a, c-1
  p=index(s(i:i),"#")
  q=index(s(i+1:i+1),"#")
   if ((p+q).eq.2) then
   print*, "No"
   return
   end if
  end do
  print*, "Yes"
  return
 end if
 
 if (c > d) then
  
  do i=b,d-2
  p=index(s(i:i),".")
  q=index(s(i+1:i+1),".")
  r=index(s(i+2:i+2),".")
   if((p+q+r).eq.3) then
   sum = i+1
   p=0
   q=0
   r=0
   end if
  end do
  
  if(sum.ne.0) then
   s(sum:sum)="#"
    do i=a, c-1
    p=index(s(i:i),"#")
    q=index(s(i+1:i+1),"#")
     if ((p+q).eq.2) then
     print*, "NO"
     return
     end if
    end do
    s(c:c)="#"
  do i=b, d-1
  p=index(s(i:i),"#")
  q=index(s(i+1:i+1),"#")
   if ((p+q).eq.2) then
   print*, "NO"
   print*, sum
   return
   end if
  end do
  print*, "Yes"
  return
 end if
 
 if (sum.eq.0) then
 do i=b, d-1
  p=index(s(i:i),"#")
  q=index(s(i+1:i+1),"#")
   if ((p+q).eq.2) then
   print*, "No"
   return
   end if
  end do
  s(d:d)="#"
  do i=a, c-1
  p=index(s(i:i),"#")
  q=index(s(i+1:i+1),"#")
   if ((p+q).eq.2) then
   print*, "No"
   return
   end if
  end do
  print*, "Yes"
  return
 end if
 end if
end program