Problem:
Score : 400 points

Problem Statement

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.

Sample Input 1

7 1 3 6 7
.#..#..

Sample Output 1

Yes

The objective is achievable by, for example, moving the two persons as follows. (A and B represent Snuke and Fnuke, respectively.)

A#B.#..

A#.B#..

.#AB#..

.#A.#B.

.#.A#B.

.#.A#.B

.#..#AB

Sample Input 2

7 1 3 7 6
.#..#..

Sample Output 2

No

Sample Input 3

15 1 3 15 13
...#.#...#.#...

Sample Output 3

Yes

Solution in C (GCC 5.4.1) (judge verdict: Wrong Answer)

    #include<stdio.h>
    #include<stdlib.h>
    #include<math.h>
    #include<string.h>
    #include <time.h>
    typedef long long ll;
    typedef long double ld;
    #define INF (1LL<<60)
    #define MOD1 1000000007
    /*swap 交換*/
    void swap(ll *a, ll *b){ll c;c=*b;*b=*a;*a=c;}
    /*2つのうち大きい数を返す*/
    ll max2(ll a,ll b){return a>=b?a:b;}
    /*2つのうち小さい数を返す*/
    ll min2(ll a,ll b){return a>=b?b:a;}
    /*絶対値*/
    ll ABS(ll a){return a>=0?a:(-a);}
    typedef struct{
        ll aa;
        ll bb;
    }frequent;
    // 小大
    int compare(const void *a, const void *b){
        return *(ll *)a>*(ll *)b?1:*(ll *)a<*(ll *)b?-1:0;}

    int main(void){
        ll n,a,b,c,d,i;
        scanf("%lld%lld%lld%lld%lld",&n,&a,&b,&c,&d);
        char s[n+5];
        scanf("%s",s);
        // ll r=0;
        if(c<d){
            for(i=a+1;i<c-1;i++){
                if(s[i]=='#'&&s[i-1]=='#'){
                    printf("No\n");
                    return 0;
                }            
            }
            for(i=b+1;i<d-1;i++){
                if(s[i]=='#'&&s[i-1]=='#'){
                    printf("No\n");
                    return 0;
                }            
            }
            printf("Yes\n");
            return 0;
        }
        ll emp=0,ok=0;
        for(i=a;i<c-1;i++){
            if(i!=a){
                if(s[i]=='#'&&s[i-1]=='#'){
                    printf("No\n");
                    return 0;
                }
            }
            if(i>=b-2&&i<=d-1){
                if(s[i]=='.'){
                    emp++;
                    if(emp>2) ok=1;
                }else{
                    emp=0;
                }
            }
            // printf("%lld ",emp);
        }
        if(ok==1){
            printf("Yes\n");
        }else{
            printf("No\n");
        }
        return 0;
    }