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) throws Exception {
        Scanner sc = new Scanner(System.in);
        Main m = new Main(sc);
        m.show(m.solve());
        sc.close();
    }
    
	//フィールド
    Scanner sc;
    int N;
    int A;	//すぬけ
    int B;	//ふぬけ
    int C;
    int D;
    String S;
    
    //入力
    Main(Scanner sc) {
        this.sc = sc;
        this.N = sc.nextInt();
        this.A = sc.nextInt();
        this.B = sc.nextInt();
        this.C = sc.nextInt();
        this.D = sc.nextInt();
        this.S = sc.next();
    }
    
    //解答処理
    private String solve() {
        String answer = "Yes";
        
        if (S.charAt(C-1) == '#' || S.charAt(D-1) == '#') {
        	//マスCとマスDどちらかに岩があったらNo
        	answer = "No";
        	return answer;
        }
        
        if (C < D) {
        	String tmp = S.substring(A-1,D);
        	//2連続岩ならNo
        	if (tmp.contains("##")) {
        		answer = "No";
        		return answer;
        	}
        } else {
        	String tmp = S.substring(B-2,D+1);
        	//3連続空きが無ければNo
        	if (!tmp.contains("...")) {
        		answer = "No";
        	}
        }
        
        return answer;
    }
    
    //出力
    public void show(String answer) {
        System.out.println(answer);
    }

}
