import core.bitop, std.algorithm, std.ascii, std.bigint, std.conv, std.math,
    std.functional, std.numeric, std.range, std.stdio, std.string, std.random,
    std.typecons, std.container, std.format;

// dfmt off
T lread(T = long)(){return readln.chomp.to!T();}
T[] lreads(T = long)(long n){return generate(()=>readln.chomp.to!T()).take(n).array();}
T[] aryread(T = long)(){return readln.split.to!(T[])();}
void scan(TList...)(ref TList Args){auto line = readln.split();
foreach (i, T; TList){T val = line[i].to!(T);Args[i] = val;}}
alias sread = () => readln.chomp();enum MOD = 10 ^^ 9 + 7;
alias PQueue(T, alias less = "a<b") = BinaryHeap!(Array!T, less);
// dfmt on

void main()
{
    long N, A, B, C, D;
    scan(N, A, B, C, D);
    A--, B--, C--, D--;
    auto S = sread();
    auto safe = new bool[](N);
    foreach (i; 0 .. N)
        safe[i] = (S[i] == '.');
    bool reachableA = true, reachableB = true, skippable;
    foreach (i; 0 .. N)
    {
        if (A < i && i <= C && S[i] == '#' && S[i - 1] == '#')
            reachableA = false;
        if (B < i && i <= D && S[i] == '#' && S[i - 1] == '#')
            reachableB = false;
        if (B <= i && i <= D && i + 1 < N && S[i - 1] == '.' && S[i] == '.' && S[i + 1] == '.')
            skippable = true;
    }
    if (!reachableA || !reachableB)
    {
        writeln("No");
        return;
    }
    if (C < D)
    {
        writeln("Yes");
        return;
    }
    writeln(skippable ? "Yes" : "No");
}
