#include <iostream>
#include <sstream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <ctime>
#include <cstring>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <bitset>
#include <numeric>
#include <utility>
#include <iomanip>
#include <algorithm>
#include <functional>
#include <unordered_map>
using namespace std;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

template<class T> vector<T> make_vec(size_t a) { return vector<T>(a); }
template<class T, class... Ts> auto make_vec(size_t a, Ts... ts) {
  return vector<decltype(make_vec<T>(ts...))>(a, make_vec<T>(ts...));
}
template<class T, class V>
typename enable_if<is_class<T>::value == 0>::type fill(T &t, const V &v) {
    t = v;
}
template<class T, class V>
typename enable_if<is_class<T>::value != 0>::type fill(T &t, const V &v){
    for (auto &e : t) fill(e, v);
}

#define COUT(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << endl
template<class T1, class T2> ostream& operator << (ostream &s, pair<T1,T2> P)
{ return s << '<' << P.first << ", " << P.second << '>'; }
template<class T> ostream& operator << (ostream &s, vector<T> P)
{ for (int i = 0; i < P.size(); ++i) { if (i > 0) { s << " "; } s << P[i]; } return s; }
template<class T> ostream& operator << (ostream &s, vector<vector<T> > P)
{ for (int i = 0; i < P.size(); ++i) { s << endl << P[i]; } return s << endl; }

#define EACH(i, s) for (__typeof__((s).begin()) i = (s).begin(); i != (s).end(); ++i)
template<class T> ostream& operator << (ostream &s, set<T> P)
{ EACH(it, P) { s << "<" << *it << "> "; } return s << endl; }
template<class T1, class T2> ostream& operator << (ostream &s, map<T1,T2> P)
{ EACH(it, P) { s << "<" << it->first << "->" << it->second << "> "; } return s << endl; }

using pint = pair<int,int>;
int N, A, B, C, D;
string S;


bool solve() {
    --A, --B, --C, --D;
    
    vector<pint> each;
    for (int i = 0; i < S.size();) {
        int j = i+1;
        while (j < S.size() && !(S[j-1] == '#' && S[j] == '#')) ++j;
        each.push_back(pint(i, j));
        i = j;
    }

    int iA = -1, iB = -1, iC = -1, iD = -1;
    for (int i = 0; i < each.size(); ++i) {
        if (each[i].first <= A && A < each[i].second) iA = i;
        if (each[i].first <= B && B < each[i].second) iB = i;
        if (each[i].first <= C && C < each[i].second) iC = i;
        if (each[i].first <= D && D < each[i].second) iD = i;
    }
    //COUT(each); COUT(iA); COUT(iB); COUT(iC); COUT(iD);

    if (iA != iC) return false;
    if (iB != iD) return false;
    if (iA != iB) return true;
    if (C < D) return true;

    bool exist = false;
    for (int i = B; i <= D; ++i) {
        if (S[i-1] == '.' && S[i] == '.' && S[i+1] == '.') exist = true;
    }
    return exist;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    
    while (cin >> N >> A >> B >> C >> D >> S) {
        if (solve()) cout << "Yes" << endl;
        else cout << "No" << endl;
    }
}


















Measured memory_bytes: 592