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++14 (GCC 5.4.1) (judge verdict: Wrong Answer)

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int inf = 1e9 + 7;
using pii = pair<int, int>;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rrep(i, st, n) for (int i = st; i < n; ++i)
#define chmax(a, b) a = max(a, b)
#define chmin(a, b) a = min(a, b)
int dx[] = {0, 0, -1, 1};
int dy[] = {1, -1, 0, 0};
const int mod = 1e9 + 7;
ll power(ll a,ll b){return b?power(a*a%mod,b/2)*(b%2?a:1)%mod:1;}
void solve(int a, int b, int c, int d, string s) {
    //a < b, d < c
    rrep(i, b, d + 1 + 1) {
        if (i - 1 < 0 || i - 2 < 0) continue;
        if (s[i] == '.' && s[i - 1] == '.' && s[i - 2] == '.') {
            cout << "Yes" << endl;
            return;
        }
    }
    cout << "No" << endl;
    return;
}
int main() {
    cin.tie(0); ios::sync_with_stdio(false);
    int n, a, b, c, d; cin >> n >> a >> b >> c >> d;
    string s; cin >> s;
    rrep(i, a + 1, c + 1) {
        if (s[i - 1] == '#' && s[i] == '#') {
            cout << "No" << endl;
            return 0;
        }
    }
    rrep(i, b + 1, d + 1) {
        if (s[i - 1] == '#' && s[i] == '#') {
            cout << "No" << endl;
            return 0;
        }
    }
    /*
    int dp[2][s.size()]; rep(i, 2) rep(j, s.size()) dp[i][j] = 0;
    //aが0j, bが1j
    dp[0][a] = 1;
    dp[1][b] = 1;
    rrep(i, a + 1, c + 1) {
        if (s[i] == '#') continue;
        dp[i] = dp[i - 1]
    }
     */
    if ((a < b && c < d) || (b < a && d < c)) {
        cout << "Yes" << endl;
        return 0;
    }
    if (a < b) solve(a, b, c, d, s);
    else solve(b, a, d, c, s);
    //どっかで入れ替わる
    //右にしか進めない
    //a < b, d < c
    /*
    int flg = 0;
    rrep(i, max(b, 2), d + 1) {
        if (s[i] == '.' && s[i - 1] == '.' && s[i - 2] == '.') {
            flg = 1;
            break;
        }
    }*/
    /*
    int table[s.size()]; rep(i, s.size()) table[i] = -1;
    table[b] = 0;
    if (s[b + 1] != '#') table[b + 1] = 1;
    if (s[b + 2] != '#') table[b + 2] = 1;
    rrep(i, b, d + 1) {
        if (table[i] != -1) {
            if (i + 1 >= s.size()) break;
            if (s[i + 1] != '#') {
                if (table[i + 1] == -1) table[i + 1] = table[i] + 1;
                else table[i + 1] += 1e6 * (table[i] + 1);
            }
            if (i + 2 >= s.size()) break;
            if (s[i + 2] != '#') {
                if (table[i + 2] == -1) table[i + 2] = table[i] + 1;
                else table[i + 2] += 1e6 * (table[i] + 1);
            }
        }
    }
    rep(i, s.size()) cout << table[i] << " "; cout << endl;
     */
    
}