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.Scanner;

public class Main {

	public static void main(String[] args) {
		Scanner scn = new Scanner(System.in);
		int N = scn.nextInt();
		int A = scn.nextInt(), B = scn.nextInt(), C = scn.nextInt(), D = scn.nextInt();
		scn.nextLine();
		char[] ch = scn.nextLine().toCharArray();
		boolean can = true;
		if(A < B) {
			if(C < D) {
				can &= check(ch,B,D);
				can &= check(ch,A,C);
			}else {
				can &= check(ch,B,D);
				can &= check(ch,A,C);
				can &= check_space(ch,B,D);
			}
		}

		System.out.println(can?"Yes":"No");
	}

	public static boolean check(char[] ch, int S, int G) {
		boolean can = true;
		boolean before = false;
		for(int i = S;i < G;i++) {
			if(ch[i] == '#') {
				if(before) {
					can = false;
					break;
				}
				before = true;
			}else {
				before = false;
			}
		}

		return can;
	}

	public static boolean check_space(char[] ch, int S, int G) {
		boolean can = false;
		int count_space = 0;
		for(int i = S-2;i < G+1;i++) {
			if(ch[i] == '.') {
				count_space++;
				if(count_space==3) {
					can = true;
					break;
				}
			}else {
				count_space = 0;
			}
		}

		return can;
	}

}
