{"raw_statement":[{"iden":"problem statement","content":"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.\nIn the beginning, Snuke stands on Square $A$, and Fnuke stands on Square $B$.\nYou can repeat the following operation any number of times:\n\n*   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.\n\nYou want to repeat this operation so that Snuke will stand on Square $C$ and Fnuke will stand on Square $D$.\nDetermine whether this is possible."},{"iden":"constraints","content":"*   $4 \\leq N \\leq 200\\ 000$\n*   $S$ is a string of length $N$ consisting of `.` and `#`.\n*   $1 \\leq A, B, C, D \\leq N$\n*   Square $A$, $B$, $C$ and $D$ do not contain a rock.\n*   $A$, $B$, $C$ and $D$ are all different.\n*   $A < B$\n*   $A < C$\n*   $B < D$"},{"iden":"input","content":"Input is given from Standard Input in the following format:\n\n$N$ $A$ $B$ $C$ $D$\n$S$"},{"iden":"sample input 1","content":"7 1 3 6 7\n.#..#.."},{"iden":"sample output 1","content":"Yes\n\nThe objective is achievable by, for example, moving the two persons as follows. (`A` and `B` represent Snuke and Fnuke, respectively.)\n\nA#B.#..\n\nA#.B#..\n\n.#AB#..\n\n.#A.#B.\n\n.#.A#B.\n\n.#.A#.B\n\n.#..#AB"},{"iden":"sample input 2","content":"7 1 3 7 6\n.#..#.."},{"iden":"sample output 2","content":"No"},{"iden":"sample input 3","content":"15 1 3 15 13\n...#.#...#.#..."},{"iden":"sample output 3","content":"Yes"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}