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.

Examples

Input

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


Output

Yes


Input

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


Output

No


Input

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


Output

Yes

public class Main {


  private static void solve() {
    int n = ni();
    int a = ni() - 1;
    int b = ni() - 1;
    int c = ni() - 1;
    int d = ni() - 1;
    char[] s = ns();

    if (a < b) {
      int tmp;
      tmp = a;
      a  = b;
      b = tmp;
      
      tmp = c;
      c = d;
      d = tmp;
    }
    s[a] = 'A';
    s[b] = 'B';

    if (!sim(s, a, c, true)) {
      System.out.println("No");
      return;
    }
    
    if (!sim(s, b, d, false)) {
      System.out.println("No");
      return;
    }

    for (a = 0; a < n; a ++) {
      if (s[a] == 'A') break;
    }
    if (!sim(s, a, c, false)) {
      System.out.println("No");
      return;
    }
    
    System.out.println("Yes");

  }

  private static boolean sim(char[] s, int a, int c, boolean stop) {
    int n = s.length;
    char d = s[a];
    int dir = a < c ? 1 : -1;
    for (; a != c; a += dir) {
      if (stop && Math.max(a + dir, a - dir) < n && Math.min(a + dir, a - dir) >= 0 && s[a + dir] == '.'
          && s[a - dir] == '.') {
        break;
      }

      if (s[a + dir] != '.') {
        if (a + dir + dir < 0 || a + dir + dir >= n || s[a + dir + dir] != '.') {
          return false;
        }
        s[a] = '.';
        s[a + dir + dir] = d;
        a += dir;
      } else {
        s[a] = '.';
        s[a + dir] = d;
      }

    }
    return true;
  }

  public static void main(String[] args) {
    new Thread(null, new Runnable() {
      @Override
      public void run() {
        long start = System.currentTimeMillis();
        String debug = args.length > 0 ? args[0] : null;
        if (debug != null) {
          try {
            is = java.nio.file.Files.newInputStream(java.nio.file.Paths.get(debug));
          } catch (Exception e) {
            throw new RuntimeException(e);
          }
        }
        reader = new java.io.BufferedReader(new java.io.InputStreamReader(is), 32768);
        solve();
        out.flush();
        tr((System.currentTimeMillis() - start) + "ms");
      }
    }, "", 64000000).start();
  }

  private static java.io.InputStream is = System.in;
  private static java.io.PrintWriter out = new java.io.PrintWriter(System.out);
  private static java.util.StringTokenizer tokenizer = null;
  private static java.io.BufferedReader reader;

  public static String next() {
    while (tokenizer == null || !tokenizer.hasMoreTokens()) {
      try {
        tokenizer = new java.util.StringTokenizer(reader.readLine());
      } catch (Exception e) {
        throw new RuntimeException(e);
      }
    }
    return tokenizer.nextToken();
  }

  private static double nd() {
    return Double.parseDouble(next());
  }

  private static long nl() {
    return Long.parseLong(next());
  }

  private static int[] na(int n) {
    int[] a = new int[n];
    for (int i = 0; i < n; i++)
      a[i] = ni();
    return a;
  }

  private static char[] ns() {
    return next().toCharArray();
  }

  private static long[] nal(int n) {
    long[] a = new long[n];
    for (int i = 0; i < n; i++)
      a[i] = nl();
    return a;
  }

  private static int[][] ntable(int n, int m) {
    int[][] table = new int[n][m];
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < m; j++) {
        table[i][j] = ni();
      }
    }
    return table;
  }

  private static int[][] nlist(int n, int m) {
    int[][] table = new int[m][n];
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < m; j++) {
        table[j][i] = ni();
      }
    }
    return table;
  }

  private static int ni() {
    return Integer.parseInt(next());
  }

  private static void tr(Object... o) {
    if (is != System.in)
      System.out.println(java.util.Arrays.deepToString(o));
  }
}
