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 sc = new Scanner(System.in);
        // 整数の入力
        int n = sc.nextInt();
        int a = sc.nextInt();
        int b = sc.nextInt();
        int c = sc.nextInt();
        int d = sc.nextInt();
        boolean flag = true;

        // 文字列の入力
        String s = sc.next();
        s = '#' + s; // 入力が１ずれているのでこれで修正
        sc.close();
            if(!canReach(n, a, c, s) || !canReach(n, b, d, s)){
                flag = false;
            }

        if((c > d) && flag) {
            flag = checkflag(n, b, d, s);
        }

        if (flag) {
            System.out.println("Yes");
        } else {
            System.out.println("No");

        }
    }
    public static boolean canReach(int n, int start, int goal, String s) {
        for (int i = start; i <= goal; i++) {
            if ((s.charAt(i) == '#') && (s.charAt(i + 1) == '#')) {
                return false;
            }
        }
        return true;
    }

    public static boolean checkflag(int n, int b, int d, String s) {
        for (int i = b; i <= d; i++) {
            if (i > 0) {
                if ((s.charAt(i) == '.') && (s.charAt(i + 1) == '.') && (s.charAt(i - 1) == '.')&& b!=i+1) {
                    return true;
                }
            }
        }
        return false;
    }
}
