{"problem":{"name":"Kenken Race","description":{"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 ","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"agc034_a"},"statements":[{"statement_type":"Markdown","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.\n\n## Constraints\n\n*   $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$\n\n## Input\n\nInput is given from Standard Input in the following format:\n\n$N$ $A$ $B$ $C$ $D$\n$S$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"agc034_a","tags":[],"sample_group":[["7 1 3 6 7\n.#..#..","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"],["7 1 3 7 6\n.#..#..","No"],["15 1 3 15 13\n...#.#...#.#...","Yes"]],"created_at":"2026-03-03 11:01:14"}}