#include <bits/stdc++.h>
using namespace std;
/*{{{*/  //template
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define rrep(i,n) for(int i=(n)-1;i>=0;i--)
constexpr int INF = numeric_limits<int>::max()/2;
constexpr long long LINF = numeric_limits<long long>::max()/3;
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define all(v) (v).begin(),(v).end()
#define sz(x) (int)(x).size()
#define debug(x) cerr<<#x<<":"<<x<<endl
#define debug2(x,y) cerr<<#x<<","<<#y":"<<x<<","<<y<<endl
//struct fin{ fin(){ cin.tie(0); ios::sync_with_stdio(false); } } fin_;
struct Double{ double d; explicit Double(double x) : d(x){} };
ostream& operator<<(ostream& os,const Double x){ os << fixed << setprecision(20) << x.d; return os; }
template<typename T> ostream& operator<<(ostream& os,const vector<T>& vec){ os << "["; for(const auto& v : vec){ os << v << ","; } os << "]"; return os; }
template<typename T,typename U> ostream& operator<<(ostream& os, const map<T,U>& mp){ os << "{"; for(auto& p : mp){ os << p << ","; } os << "}"; return os; }
template<typename T,typename U> ostream& operator<<(ostream& os,const pair<T,U>& p){ os << "(" << p.first << ","<< p.second <<")"; return os; }
template<typename T> ostream& operator<<(ostream& os,const set<T>& st){ os<<"{"; for(T v:st) os<<v<<","; os <<"}"; return os; }
template<typename T,typename U> inline void chmax(T &x,U y){ if(y>x) x = y; }
template<typename T,typename U> inline void chmin(T &x,U y){ if(y<x) x = y; }
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
ll gcd(ll a,ll b){ if(b==0) return a; else return gcd(b,a%b); }
//constexpr double eps = 1e-14; 
constexpr double eps = 1e-10; 
constexpr ll mod = 1e9+7;
const int dx[]={1,0,-1,0} ,dy[] = {0,1,0,-1};
/*}}}*/

int main(){
    int n,a,b,c,d;
    cin >> n >> a >> b >> c >> d;
    string s; cin >> s;
    a--;
    b--;
    c--;
    d--;

    if(c < d){
        bool snk = true;
        for(int i=a;i<c;i++){
            if(s[i] == '#' and s[i+1] == '#'){
                snk = false;
                break;
            }
        }
        bool hnk = true;
        for(int i=b;i<d;i++){
            if(s[i] == '#' and s[i+1] == '#'){
                hnk = false;
                break;
            }
        }

        if(snk and hnk){
            cout << "Yes" << endl;
        }else{
            cout << "No" << endl;
        }
    }else{
        bool hnk = true;
        for(int i=b;i<d;i++){
            if(s[i] == '#' and s[i+1] == '#'){
                hnk = false;
                break;
            }
        }
        if(!hnk){
            cout << "No" << endl;
            return 0;
        }

        bool ok = false;
        for(int i=b-1;i<=d-1;i++){
            if(s[i] == '.' and s[i+1] == '.' and s[i+2] == '.'){
                ok = true;
                break;
            }
        }
        if(!ok){
            // TODO ここでNoになってるが実はYesのパターンがある
            cout << "No" << endl;
            return 0;
        }

        bool snk = true;
        for(int i=a;i<c;i++){
            if(s[i] == '#' and s[i+1] == '#'){
                snk = false;
                break;
            }
        }
        if(!snk){
            cout << "No" << endl;
            return 0;
        }

        // OK
        cout << "Yes" << endl;
    }
}


Measured memory_bytes: 644