#include <bits/stdc++.h>
#define ll long long
#define INF 1000000005
#define MOD 1000000007
#define EPS 1e-10
#define rep(i,n) for(int i=0;i<(int)(n);++i)
#define rrep(i,n) for(int i=(int)(n)-1;i>=0;--i)
#define srep(i,s,t) for(int i=(int)(s);i<(int)(t);++i)
#define each(a,b) for(auto& (a): (b))
#define all(v) (v).begin(),(v).end()
#define len(v) (int)(v).size()
#define zip(v) sort(all(v)),v.erase(unique(all(v)),v.end())
#define cmx(x,y) x=max(x,y)
#define cmn(x,y) x=min(x,y)
#define fi first
#define se second
#define pb push_back
#define show(x) cout<<#x<<" = "<<(x)<<endl
#define sar(a,n) cout<<#a<<":";rep(pachico,n)cout<<" "<<a[pachico];cout<<endl

using namespace std;

template<typename S,typename T>auto&operator<<(ostream&o,pair<S,T>p){return o<<"{"<<p.fi<<","<<p.se<<"}";}
template<typename T>auto&operator<<(ostream&o,set<T>s){for(auto&e:s)o<<e<<" ";return o;}
template<typename S,typename T,typename U>
auto&operator<<(ostream&o,priority_queue<S,T,U>q){while(!q.empty())o<<q.top()<<" ",q.pop();return o;}
template<typename K,typename T>auto&operator<<(ostream&o,map<K,T>m){for(auto&e:m)o<<e<<" ";return o;}
template<typename T>auto&operator<<(ostream&o,vector<T>v){for(auto&e:v)o<<e<<" ";return o;}
void ashow(){cout<<endl;}template<typename T,typename...A>void ashow(T t,A...a){cout<<t<<" ";ashow(a...);}

typedef pair<int,int> P;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef vector<P> vp;
typedef vector<double> vd;
typedef vector<string> vs;

const int MAX_N = 100005;

int main()
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    int n, a, b, c, d;
    cin >> n >> a >> b >> c >> d;
    --a, --b, --c, --d;
    string s;
    cin >> s;
    if(c < d){
        // bool ok = false;
        // int nw = b;
        // while(true){
        //     if(d == nw+1 || d == nw+2){
        //         ok = true;
        //         break;
        //     }
        //     if(nw+2 < n && s[nw+2] == '.'){
        //         nw += 2;
        //     }else if(nw+1 < n && s[nw+1] == '.'){
        //         nw += 1;
        //     }else{
        //         break;
        //     }
        // }
        // bool ok = false;
        // int nw = b;
        // while(true){
        //     if(d == nw+1 || d == nw+2){
        //         ok = true;
        //         break;
        //     }
        //     if(nw+2 < n && s[nw+2] == '.'){
        //         nw += 2;
        //     }else if(nw+1 < n && s[nw+1] == '.'){
        //         nw += 1;
        //     }else{
        //         break;
        //     }
        // }
        bool dame = false;
        srep(i,a,d){
            if(s[i] == '#' && s[i+1] == '#'){
                dame = true;
                break;
            }
        }
        if(dame){
            cout << "No\n";
        }else{
            cout << "Yes\n";
        }
    }else{
        bool dame = false;
        srep(i,a,d){
            if(s[i] == '#' && s[i+1] == '#'){
                dame = true;
                break;
            }
        }
        if(dame){
            cout << "No\n";
            return 0;
        }
        bool ok = false;
        srep(i,b,d+1){
            if(s[i] == '.'){
                if(s[i-1] == '.' && s[i+1] == '.'){
                    ok = true;
                    break;
                }
            }
        }
        if(ok){
            cout << "Yes\n";
        }else{
            cout << "No\n";
        }
    }
    return 0;
}


Measured memory_bytes: 592