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.

Examples

Input

7 1 3 6 7
.#..#..


Output

Yes


Input

7 1 3 7 6
.#..#..


Output

No


Input

15 1 3 15 13
...#.#...#.#...


Output

Yes
import java.util.*;


public class Main{
	
	public static void main(String... args){
		Scanner scan = new Scanner(System.in);
		
		// input
		final int NUM = scan.nextInt();
		int a = scan.nextInt() - 1;
		int b = scan.nextInt() - 1;
		int c = scan.nextInt() - 1;
		int d = scan.nextInt() - 1;
		char[] road = scan.next().toCharArray();
		
		// search
		if(c < d){
			String answer = "Yes";
			boolean memory = false;
			for(int i = a; i <= d; i++){
				if(road[i] == '#' && memory == true){
					answer = "No";
				} else if (road[i] == '#'){
					memory = true;
				} else {
					memory = false;
				}
			}
			System.out.println(answer);
		} else {
			String answer = "Yes";
			boolean memory = false;
			for(int i = a; i <= c; i++){
				if(road[i] == '#' && memory == true){
					answer = "No";
				} else if (road[i] == '#'){
					memory = true;
				} else {
					memory = false;
				}
			}
			if(answer.equals("Yes")){
				answer = "No";
				for(int i = b; i <= d ; i++){
					if(road[i-1] == '.' && road[i] == '.' && road[i+1] == '.' ){
						answer = "Yes";
					}
				}
			}
			System.out.println(answer);
		}
	}
}