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;

// https://atcoder.jp/contests/agc034/submissions/5769395
// https://atcoder.jp/contests/agc034/submissions/5749660

public class Main {
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		
		try (Scanner sc = new Scanner(System.in)) {
			int fieldSize = sc.nextInt(); // N
			int sNow = sc.nextInt() - 1; // A
			int hNow = sc.nextInt() - 1; // B 
			int sGoal = sc.nextInt() - 1; // C
			int hGoal = sc.nextInt() - 1; // D
			String s = sc.next();
			
			boolean q1 = s.substring(sNow, sGoal).contains("##");
			boolean q2 = s.substring(hNow,hGoal).contains("##");
			
			boolean res = false;
			res = !(q1 || q2);
			
			if (sGoal > hGoal) {
				/*
				 * 開始視点がH君よりうしろのS君のゴールが、H君より後ろにある場合、
				 * 追い抜く必要がある。
				 * 追い抜くには、H君のゴール地点の１つ後ろまでを含めte
				 * ”...”があれば、途中でH君を追い抜ける。
				 * 1. 　”.hGol.”
				 */
				res &= s.substring(hNow-1, hGoal+2).contains("...");
			}
			
			System.out.println(res ? "Yes" : "No");
			
		} catch (Exception e) {
			// TODO: handle exception
		}

	}

}
