//include
//------------------------------------------
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <fstream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <string>
#include <cstring>
#include <ctime>
#include <climits>
#include <limits>

using namespace std;

//conversion
//------------------------------------------
inline int toInt(string s) { int v; istringstream sin(s); sin >> v; return v; }
template<class T> inline string toString(T x) { ostringstream sout; sout << x; return sout.str(); }

//math
//-------------------------------------------
template<class T> inline T sqr(T x) { return x * x; }

//typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;

//container util
//------------------------------------------
#define ALL(a)  (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define EXISTch(s,c) ((((s).find_first_of(c)) != std::string::npos)? 1 : 0)//cがあれば1 if(1)
#define SORT(c) sort((c).begin(),(c).end())

#define REP(i,n) for(int i=0;i<(int)n;++i)
#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)

//constant
//--------------------------------------------
const double EPS = 1e-10;
const double PI = acos(-1.0);
const int INF = (int)1000000007;
const LL MOD = (LL)1000000007;//10^9+7
const LL INF2 = (LL)100000000000000000;//10^18

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

	s += "###";

	if (c > a && c < b) {
		bool f = true;
		for (int i = a+2; i <=c-1; i++) {
			if (s[i] == '#'&& s[i - 1] == '#') {
				f = false;
			}
		}

		for (int i = b + 2; i <= d - 1; i++) {
			if (s[i] == '#'&& s[i - 1] == '#') {
				f = false;
			}
		}

		if (f) {
			cout << "Yes" << endl;
		}
		else {
			cout << "No" << endl;
		}

		return 0;
	}

	if (c > b && c < d) {
		bool f = true;
		for (int i = a + 2; i <= c - 1; i++) {
			if (s[i] == '#'&& s[i - 1] == '#') {
				f = false;
			}
		}

		for (int i = b + 2; i <= d - 1; i++) {
			if (s[i] == '#'&& s[i - 1] == '#') {
				f = false;
			}
		}

		if (f) {
			cout << "Yes" << endl;
		}
		else {
			cout << "No" << endl;
		}

		return 0;
	}

	if (c > b && c > d) {
		bool g = false;

		int id = b;
		while (id < d + 1) {
			if (s[id - 1] == '.' && s[id + 1] == '.') {
				g = true;
			}

			if (s[id + 1] == '.') {
				id++;
			}
			else if(s[id+2]=='.'){
				id += 2;
			}
			else {
				id = d + 1;
			}
		}

		bool f = true;
		for (int i = a + 2; i <= c - 1; i++) {
			if (s[i] == '#'&& s[i - 1] == '#') {
				f = false;
			}
		}

		for (int i = b + 2; i <= d - 1; i++) {
			if (s[i] == '#'&& s[i - 1] == '#') {
				f = false;
			}
		}

		if (f&&g) {
			cout << "Yes" << endl;
		}
		else {
			cout << "No" << endl;
		}

		return 0;
	}

	return 0;
}

Measured memory_bytes: 640