N,A,B,C,D = map(int,input().split())
S = input()

if "##" in S[A-1:max(C,D)-1]:
  print("No")
  exit()
if C < D:
  print("Yes")
  exit()

count = 0
for i in range(B-1,D):
  if D != len(S): 
    if S[i] == "." and S[i-1] == "." and S[i+1] == ".":
      print("Yes")
      exit()
print("No") N,A,B,C,D = map(int,input().split()) N map(int,input().split()) map int input().split() ().split () input split A B C D S = input() S input() input if "##" in S[A-1:max(C,D)-1]:
  print("No")
  exit() "##" in S[A-1:max(C,D)-1] "##" S[A-1:max(C,D)-1] S A-1:max(C,D)-1 A-1 A 1 max(C,D)-1 max(C,D) max C D 1 print("No") print "No" exit() exit if C < D:
  print("Yes")
  exit() C < D C D print("Yes") print "Yes" exit() exit count = 0 count 0 for i in range(B-1,D):
  if D != len(S): 
    if S[i] == "." and S[i-1] == "." and S[i+1] == ".":
      print("Yes")
      exit() i range(B-1,D) range B-1 B 1 D if D != len(S): 
    if S[i] == "." and S[i-1] == "." and S[i+1] == ".":
      print("Yes")
      exit() D != len(S) D len(S) len S if S[i] == "." and S[i-1] == "." and S[i+1] == ".":
      print("Yes")
      exit() S[i] == "." and S[i-1] == "." and S[i+1] == "." S[i] == "." and S[i-1] == "." S[i] == "." S[i] S i "." S[i-1] == "." S[i-1] S i-1 i 1 "." S[i+1] == "." S[i+1] S i+1 i 1 "." print("Yes") print "Yes" exit() exit print("No") print "No" C,D = map(int,input().split()) map(int,input().split()) C D = map(int,input().split()) map(int,input().split()) D B,C,D = map(int,input().split()) map(int,input().split()) B A,B,C,D = map(int,input().split()) map(int,input().split()) A S = input() input() S N,A,B,C,D = map(int,input().split()) map(int,input().split()) N count = 0 0 count
N,A,B,C,D = map(int,input().split())
S = input()

if "##" in S[A-1:max(C,D)-1]:
  print("No")
  exit()
if C < D:
  print("Yes")
  exit()

count = 0
for i in range(B-1,D):
  if D != len(S): 
    if S[i] == "." and S[i-1] == "." and S[i+1] == ".":
      print("Yes")
      exit()
print("No")