Problem:
Score : 400 points

Problem Statement

There are N squares arranged in a row, numbered 1, 2, ..., N from left to right.
You are given a string S of length N consisting of . and #. If the i-th character of S is #, Square i contains a rock; if the i-th character of S is ., Square i is empty.

In the beginning, Snuke stands on Square A, and Fnuke stands on Square B.

You can repeat the following operation any number of times:

Choose Snuke or Fnuke, and make him jump one or two squares to the right. The destination must be one of the squares, and it must not contain a rock or the other person.

You want to repeat this operation so that Snuke will stand on Square C and Fnuke will stand on Square D.

Determine whether this is possible.

Constraints

4 \leq N \leq 200\ 000

S is a string of length N consisting of . and #.

1 \leq A, B, C, D \leq N

Square A, B, C and D do not contain a rock.

A, B, C and D are all different.

A < B

A < C

B < D

Input

Input is given from Standard Input in the following format:

N A B C D
S

Output

Print Yes if the objective is achievable, and No if it is not.

Sample Input 1

7 1 3 6 7
.#..#..

Sample Output 1

Yes

The objective is achievable by, for example, moving the two persons as follows. (A and B represent Snuke and Fnuke, respectively.)

A#B.#..

A#.B#..

.#AB#..

.#A.#B.

.#.A#B.

.#.A#.B

.#..#AB

Sample Input 2

7 1 3 7 6
.#..#..

Sample Output 2

No

Sample Input 3

15 1 3 15 13
...#.#...#.#...

Sample Output 3

Yes

Solution in C# (Mono 4.6.2.0) (judge verdict: Accepted)

using System;
using System.Collections.Generic;
using System.Linq;
using System.IO;
using SB = System.Text.StringBuilder;
//using System.Threading.Tasks;
//using System.Text.RegularExpressions;
//using System.Globalization;
//using System.Diagnostics;
using static System.Console;
using System.Numerics;
using static System.Math;
using pair = Pair<int, int>;

class Program
{
    static void Main()
    {
        //SetOut(new StreamWriter(OpenStandardOutput()) { AutoFlush = false });
        new Program().solve();
        Out.Flush();
    }
    readonly Scanner cin = new Scanner();
    readonly int[] dd = { 0, 1, 0, -1, 0 }; //→↓←↑
    readonly int mod = 1000000007;
    readonly int dom = 998244353;
    bool chmax<T>(ref T a, T b) where T : IComparable<T> { if (a.CompareTo(b) < 0) { a = b; return true; } return false; }
    bool chmin<T>(ref T a, T b) where T : IComparable<T> { if (b.CompareTo(a) < 0) { a = b; return true; } return false; }

    void solve()
    {
        int N = cin.nextint;
        int A = cin.nextint - 1;
        int B = cin.nextint - 1;
        int C = cin.nextint - 1;
        int D = cin.nextint - 1;

        var S = ReadLine();

        if (C < D)
        {
            var okhu = new bool[N];
            okhu[B] = true;
            for (int i = B + 1; i <= D; i++)
            {
                if (S[i] == '#')
                {
                    continue;
                }
                if (i - 1 >= 0 && okhu[i - 1])
                {
                    okhu[i] = true;
                }
                if (i - 2 >= 0 && okhu[i - 2])
                {
                    okhu[i] = true;
                }
            }
            var oksu = new bool[N];
            oksu[A] = true;
            for (int i = A + 1; i <= C; i++)
            {
                if (S[i] == '#')
                {
                    continue;
                }
                if (i - 1 >= 0 && oksu[i - 1])
                {
                    oksu[i] = true;
                }
                if (i - 2 >= 0 && oksu[i - 2])
                {
                    oksu[i] = true;
                }
            }
            if (okhu[D] && oksu[C])
            {
                WriteLine("Yes");
            }
            else
            {
                WriteLine("No");
            }
        }
        else
        {
            var okhu = new bool[N];
            okhu[B] = true;
            for (int i = B + 1; i <= D; i++)
            {
                if (S[i] == '#')
                {
                    continue;
                }
                if (i - 1 >= 0 && okhu[i - 1])
                {
                    okhu[i] = true;
                }
                if (i - 2 >= 0 && okhu[i - 2])
                {
                    okhu[i] = true;
                }
            }
            var oksu = new bool[N];
            oksu[A] = true;
            for (int i = A + 1; i <= C; i++)
            {
                if (S[i] == '#')
                {
                    continue;
                }
                if (i - 1 >= 0 && oksu[i - 1])
                {
                    oksu[i] = true;
                }
                if (i - 2 >= 0 && oksu[i - 2])
                {
                    oksu[i] = true;
                }
            }
            bool nice = false;

            for (int i = B - 1; i <= D - 1; i++)
            {
                if (i + 2 < N && S[i] == '.' && S[i + 1] == '.' && S[i + 2] =='.')
                {
                    nice = true;
                    break;
                }
            }


            if (okhu[D] && oksu[C] && nice)
            {
                WriteLine("Yes");
            }
            else
            {
                WriteLine("No");
            }
            

        }

    }

}


static class Ex
{
    public static void join<T>(this IEnumerable<T> values, string sep = " ") => WriteLine(string.Join(sep, values));
    public static string concat<T>(this IEnumerable<T> values) => string.Concat(values);
    public static string reverse(this string s) { var t = s.ToCharArray(); Array.Reverse(t); return t.concat(); }

    public static int lower_bound<T>(this IList<T> arr, T val) where T : IComparable<T>
    {
        int low = 0, high = arr.Count;
        int mid;
        while (low < high)
        {
            mid = ((high - low) >> 1) + low;
            if (arr[mid].CompareTo(val) < 0) low = mid + 1;
            else high = mid;
        }
        return low;
    }
    public static int upper_bound<T>(this IList<T> arr, T val) where T : IComparable<T>
    {
        int low = 0, high = arr.Count;
        int mid;
        while (low < high)
        {
            mid = ((high - low) >> 1) + low;
            if (arr[mid].CompareTo(val) <= 0) low = mid + 1;
            else high = mid;
        }
        return low;
    }
}

class Pair<T, U> : IComparable<Pair<T, U>> where T : IComparable<T> where U : IComparable<U>
{
    public T f; public U s;
    public Pair(T f, U s) { this.f = f; this.s = s; }
    public int CompareTo(Pair<T, U> a) => f.CompareTo(a.f) != 0 ? f.CompareTo(a.f) : s.CompareTo(a.s);
    public override string ToString() => $"{f} {s}";
}

class Scanner
{
    string[] s; int i;
    readonly char[] cs = new char[] { ' ' };
    public Scanner() { s = new string[0]; i = 0; }
    public string[] scan => ReadLine().Split();
    public int[] scanint => Array.ConvertAll(scan, int.Parse);
    public long[] scanlong => Array.ConvertAll(scan, long.Parse);
    public double[] scandouble => Array.ConvertAll(scan, double.Parse);
    public string next
    {
        get
        {
            if (i < s.Length) return s[i++];
            string st = ReadLine();
            while (st == "") st = ReadLine();
            s = st.Split(cs, StringSplitOptions.RemoveEmptyEntries);
            i = 0;
            return next;
        }
    }
    public int nextint => int.Parse(next);
    public long nextlong => long.Parse(next);
    public double nextdouble => double.Parse(next);
}