#include <iostream>
#include <vector>
#include <cstdio>
#include <sstream>
#include <map>
#include <string>
#include <algorithm>
#include <queue>
#include <cmath>
#include <functional>
#include <set>
#include <ctime>
#include <random>
#include <chrono>
#include <cassert>
#include <tuple>
#include <utility>
using namespace std;

namespace {
  using Integer = long long; //__int128;
  template<class T, class S> istream& operator >> (istream& is, pair<T,S>& p){return is >> p.first >> p.second;}
  template<class T> istream& operator >> (istream& is, vector<T>& vec){for(T& val: vec) is >> val; return is;}
  template<class T> istream& operator ,  (istream& is, T& val){ return is >> val;}
  template<class T, class S> ostream& operator << (ostream& os, const pair<T,S>& p){return os << p.first << " " << p.second;}
  template<class T> ostream& operator << (ostream& os, const vector<T>& vec){for(size_t i=0; i<vec.size(); i++) os << vec[i] << (i==vec.size()-1?"":" "); return os;}
  template<class T> ostream& operator ,  (ostream& os, const T& val){ return os << " " << val;}

  template<class H> void print(const H& head){ cout << head; }
  template<class H, class ... T> void print(const H& head, const T& ... tail){ cout << head << " "; print(tail...); }
  template<class ... T> void println(const T& ... values){ print(values...); cout << endl; }

  template<class H> void eprint(const H& head){ cerr << head; }
  template<class H, class ... T> void eprint(const H& head, const T& ... tail){ cerr << head << " "; eprint(tail...); }
  template<class ... T> void eprintln(const T& ... values){ eprint(values...); cerr << endl; }

  class range{ Integer start_, end_, step_; public: struct range_iterator{ Integer val, step_; range_iterator(Integer v, Integer step) : val(v), step_(step) {} Integer operator * (){return val;} void operator ++ (){val += step_;} bool operator != (range_iterator& x){return step_ > 0 ? val < x.val : val > x.val;} }; range(Integer len) : start_(0), end_(len), step_(1) {} range(Integer start, Integer end) : start_(start), end_(end), step_(1) {} range(Integer start, Integer end, Integer step) : start_(start), end_(end), step_(step) {} range_iterator begin(){ return range_iterator(start_, step_); } range_iterator   end(){ return range_iterator(  end_, step_); } };

  inline string operator "" _s (const char* str, size_t size){ return move(string(str)); }
  constexpr Integer my_pow(Integer x, Integer k, Integer z=1){return k==0 ? z : k==1 ? z*x : (k&1) ? my_pow(x*x,k>>1,z*x) : my_pow(x*x,k>>1,z);}
  constexpr Integer my_pow_mod(Integer x, Integer k, Integer M, Integer z=1){return k==0 ? z%M : k==1 ? z*x%M : (k&1) ? my_pow_mod(x*x%M,k>>1,M,z*x%M) : my_pow_mod(x*x%M,k>>1,M,z);}
  constexpr unsigned long long operator "" _ten (unsigned long long value){ return my_pow(10,value); }

  inline int k_bit(Integer x, int k){return (x>>k)&1;} //0-indexed

  mt19937 mt(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count());

  template<class T> string join(const vector<T>& v, const string& sep){ stringstream ss; for(size_t i=0; i<v.size(); i++){ if(i>0) ss << sep; ss << v[i]; } return ss.str(); }

  inline string operator * (string s, int k){ string ret; while(k){ if(k&1) ret += s; s += s; k >>= 1; } return ret; }
}

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

  string s;
  cin >> s;

  int offset = 100;
  s = ("#"s * offset) + s + ("#"s * offset);
  n += offset;
  a += offset;
  b += offset;
  c += offset;
  d += offset;

  const int Z = 12;
  const int na = Z-2;
  const int dn = Z-1;

  vector<vector<int>> dp(Z, vector<int>(Z, 0));
  dp[na][na] = 1;
  for(int i=offset; i<=n+offset/2; i++){
    for(int head: {0,0,0,1}){
      vector<vector<int>> dp_(Z, vector<int>(Z, 0));
      if(head == 0) dp_ = dp;
      for(int x=0; x<Z; x++){
        for(int y=0; y<Z; y++){
          if(dp[x][y] == 0) continue;

          int px = i-x;
          int py = i-y;
          if(x == na) px = -100;
          if(y == na) py = -200;

          if(x == dn) px = c;
          if(y == dn) py = d;
          if(i == a && px==-100){
            px = a;
          }
          if(i == b && py==-200){
            py = b;
          }
          if(px == py) continue;

          for(int jx=0; jx<=2; jx++){
            int px_ = px + jx;
            if(px < 0) px_ = -100;
            if(px_ > i+head || px_ > c) continue;
            if(px_ >= 0 && s[px_] == '#') continue;

            int x_ = (i+head) - px_;
            if(px_ == -100) x_ = -100;
            if(x_ >= na && px_ != c) continue;
            int nx = px_ == c ? dn : x_ == -100 ? na : x_;

            for(int jy=0; jy<=2; jy++){
              int py_ = py + jy;
              if(py < 0) py_ = -200;
              if(py_ > i+head || py_ > d) continue;
              if(py_ >= 0 && s[py_] == '#') continue;
              if(px_ == py_) continue;

              int y_ = (i+head) - py_;
              if(py_ == -200) y_ = -200;
              if(y_ >= na && py_ != d) continue;

              int ny = py_ == d ? dn : y_ == -200 ? na : y_;

              dp_[nx][ny] = dp[x][y];
            }
          }
        }
      }
      swap(dp, dp_);
      if(dp[dn][dn]){
        println("Yes");
        return 0;
      }
    }
  }

  println("No");



  return 0;
}


Measured memory_bytes: 900