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
#include<bits/stdc++.h>
using namespace std;
signed main()
{
	string s;
	int n,sa,sb,ea,eb,end;
	cin>>n>>sa>>sb>>ea>>eb;
	cin>>s;
	s=s+"aaaa";
	eb--;
	ea--;
	sa--;
	sb--;
	bool check=false;
	for(int i=sa;i<max(ea,eb);i++)
	{
		if(s[i]=='#'&&s[i+1]=='#') {cout<<"No"; return 0;}
	}
	if(eb>ea) cout<<"Yes";
	else if(eb<ea)
	{
		bool check=false;
		for(int i=sb-1;i<=eb-1;i++)
		{
			if(s[i]==s[i+1]&&s[i+2]==s[i+1]&&s[i+1]=='.')
			check=true;
		}	
		if(check==true) cout<<"Yes";
		else cout<<"No";
	}
}